the k-th semi total point graph of a graph g, , ‎is a graph‎ obtained from g by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎in this paper‎, a formula for laplacian polynomial of in terms of‎ characteristic and laplacian polynomials of g is computed‎, ‎where is a connected regular graph‎.the kirchhoff index of is also computed‎.

in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.

We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the digraph. Expressions are given for the Moore-Penrose generalized inverse and the group inverse of the Kirchhoff matrix. These expressions involve the matrix ...

Existence and bifurcation of positive solutions to a Kirchhoff type equation ⎧⎪⎨ ⎪⎩ − ( a + b ∫ Ω |∇u|2 ) u= νf (x,u), in Ω, u= 0, on ∂Ω are considered by using topological degree argument and variational method. Here f is a continuous function which is asymptotically linear at zero and is asymptotically 3-linear at infinity. The new results fill in a gap of recent research about the Kirchhoff ...

Resistance distance was introduced by Klein and Randić. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all pairs of vertices. A graph G is called a cactus if each block of G is either an edge or a cycle. Denote by Cat(n; t) the set of connected cacti possessing n vertices and t cycles. In this paper, we give the first three smallest Kirchhoff indices among gra...

The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a (unit) resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices in G. For a graph G, let R(G) be the graph obtained from G by adding a new vertex co...

This paper studies the Laplacian spectrum and average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is eigenvalues a large dense graph can be effectively approximated by using degree function corresponding graphon. More specifically, we show how to approximate distribution (Kirchhoff index) graph. For all cases, provide explicit bounds...

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.