Search Results for ""

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The Sombor spectral radius rho_(Sombor) of a graph is defined as the largest eigenvalue of the Sombor matrix. Liu et al. (2022) shows that for any tree, ...

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...