Calculating the characteristic polynomial, eigenvectors and number of spanning trees of a hexagonal system

1990 ◽  
Vol 86 (7) ◽  
pp. 1033 ◽  
Author(s):  
Peter John ◽  
Horst Sachs
Keyword(s):  
Characteristic Polynomial ◽  
Spanning Trees ◽  
Hexagonal System ◽  
Number Of Spanning Trees

ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS

2015 ◽  
Vol 91 (3) ◽  
pp. 353-367 ◽  
Author(s):  
JING HUANG ◽  
SHUCHAO LI
Keyword(s):  
Lower Bound ◽  
Characteristic Polynomial ◽  
Regular Graph ◽  
Spanning Trees ◽  
Line Graph ◽  
Laplacian Spectrum ◽  
Kirchhoff Index ◽  
Subdivision Graph ◽  
Number Of Spanning Trees ◽  
Sharp Lower Bound

Given a connected regular graph $G$, let $l(G)$ be its line graph, $s(G)$ its subdivision graph, $r(G)$ the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and joining each new vertex to the end vertices of the corresponding edge and $q(G)$ the graph obtained from $G$ by inserting a new vertex into every edge of $G$ and new edges joining the pairs of new vertices which lie on adjacent edges of $G$. A formula for the normalised Laplacian characteristic polynomial of $l(G)$ (respectively $s(G),r(G)$ and $q(G)$) in terms of the normalised Laplacian characteristic polynomial of $G$ and the number of vertices and edges of $G$ is developed and used to give a sharp lower bound for the degree-Kirchhoff index and a formula for the number of spanning trees of $l(G)$ (respectively $s(G),r(G)$ and $q(G)$).

scholarly journals Kocay's Lemma, Whitney's Theorem, and some Polynomial Invariant Reconstruction Problems

10.37236/1960 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Bhalchandra D. Thatte
Keyword(s):  
Characteristic Polynomial ◽  
Spanning Trees ◽  
Minimum Degree ◽  
Direct Consequence ◽  
Hamiltonian Cycles ◽  
Polynomial Invariant ◽  
Induced Subgraphs ◽  
Expansion Theorem ◽  
Rank Polynomial ◽  
Number Of Spanning Trees

Given a graph $G$, an incidence matrix ${\cal N}(G)$ is defined on the set of distinct isomorphism types of induced subgraphs of $G$. It is proved that Ulam's conjecture is true if and only if the ${\cal N}$-matrix is a complete graph invariant. Several invariants of a graph are then shown to be reconstructible from its ${\cal N}$-matrix. The invariants include the characteristic polynomial, the rank polynomial, the number of spanning trees and the number of hamiltonian cycles in a graph. These results are stronger than the original results of Tutte in the sense that actual subgraphs are not used. It is also proved that the characteristic polynomial of a graph with minimum degree 1 can be computed from the characteristic polynomials of all its induced proper subgraphs. The ideas in Kocay's lemma play a crucial role in most proofs. Kocay's lemma is used to prove Whitney's subgraph expansion theorem in a simple manner. The reconstructibility of the characteristic polynomial is then demonstrated as a direct consequence of Whitney's theorem as formulated here.

scholarly journals Generalized Characteristic Polynomials of Join Graphs and Their Applications

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Pengli Lu ◽  
Ke Gao ◽  
Yang Yang
Keyword(s):  
Characteristic Polynomial ◽  
Regular Graph ◽  
Spanning Trees ◽  
Characteristic Polynomials ◽  
Electrical Networks ◽  
Kirchhoff Index ◽  
Laplacian Spectra ◽  
Laplacian Energy ◽  
Signless Laplacian ◽  
Number Of Spanning Trees

The Kirchhoff index ofGis the sum of resistance distances between all pairs of vertices ofGin electrical networks.LEL(G)is the Laplacian-Energy-Like Invariant ofGin chemistry. In this paper, we define two classes of join graphs: the subdivision-vertex-vertex joinG1⊚G2and the subdivision-edge-edge joinG1⊝G2. We determine the generalized characteristic polynomial of them. We deduce the adjacency (Laplacian and signless Laplacian, resp.) characteristic polynomials ofG1⊚G2andG1⊝G2whenG1isr1-regular graph andG2isr2-regular graph. As applications, the Laplacian spectra enable us to get the formulas of the number of spanning trees, Kirchhoff index, andLELofG1⊚G2andG1⊝G2in terms of the Laplacian spectra ofG1andG2.

Spectra of the generalized edge corona of graphs

2018 ◽  
Vol 10 (01) ◽  
pp. 1850002 ◽  
Author(s):  
Yanyan Luo ◽  
Weigen Yan
Keyword(s):  
Characteristic Polynomial ◽  
Spanning Trees ◽  
Simple Graph ◽  
Simple Graphs ◽  
Signless Laplacian ◽  
Number Of Spanning Trees

Let [Formula: see text] be a simple graph with [Formula: see text] edges and [Formula: see text], [Formula: see text] be [Formula: see text] simple graphs. The generalized edge corona, denoted by [Formula: see text], is the graph obtained by taking one copy of graphs [Formula: see text], [Formula: see text], [Formula: see text] and then joining two end-vertices of the [Formula: see text]th edge [Formula: see text] of [Formula: see text] to every vertex of [Formula: see text] for [Formula: see text]. In this paper, we determine and study the characteristic polynomial, Laplacian polynomial and signless Laplacian polynomial of [Formula: see text]. As an application, we also count the number of spanning trees of the generalized edge corona.

scholarly journals Properties of Commuting Graphs over Semidihedral Groups

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 103
Author(s):  
Tao Cheng ◽  
Matthias Dehmer ◽  
Frank Emmert-Streib ◽  
Yongtao Li ◽  
Weijun Liu
Keyword(s):  
Spanning Trees ◽  
Laplacian Spectrum ◽  
Vertex Connectivity ◽  
Laplacian Energy ◽  
Number Of Spanning Trees

This paper considers commuting graphs over the semidihedral group SD8n. We compute their eigenvalues and obtain that these commuting graphs are not hyperenergetic for odd n≥15 or even n≥2. We further compute the Laplacian spectrum, the Laplacian energy and the number of spanning trees of the commuting graphs over SD8n. We also discuss vertex connectivity, planarity, and minimum disconnecting sets of these graphs and prove that these commuting graphs are not Hamiltonian.

scholarly journals On the characterization of graphs with maximum number of spanning trees

1998 ◽  
Vol 179 (1-3) ◽  
pp. 155-166 ◽  
Author(s):  
L. Petingi ◽  
F. Boesch ◽  
C. Suffel
Keyword(s):  
Spanning Trees ◽  
Number Of Spanning Trees

Determinant of links, spanning trees, and a theorem of Shank

2016 ◽  
Vol 25 (09) ◽  
pp. 1641005
Author(s):  
Jun Ge ◽  
Lianzhu Zhang
Keyword(s):  
Spanning Trees ◽  
Elementary Proof ◽  
Number Of Spanning Trees

In this note, we first give an alternative elementary proof of the relation between the determinant of a link and the spanning trees of the corresponding Tait graph. Then, we use this relation to give an extremely short, knot theoretical proof of a theorem due to Shank stating that a link has component number one if and only if the number of spanning trees of its Tait graph is odd.

scholarly journals A Positive Combinatorial Formula for the Complexity of the $q$-Analog of the $n$-Cube

10.37236/2389 ◽  
2012 ◽  
Vol 19 (2) ◽  
Author(s):  
Murali Krishna Srinivasan
Keyword(s):  
Graph Theory ◽  
Explicit Formula ◽  
Classical Result ◽  
Spanning Trees ◽  
Combinatorial Formula ◽  
Algebraic Graph Theory ◽  
The Matrix ◽  
Number Of Spanning Trees

The number of spanning trees of a graph $G$ is called the complexity of $G$. A classical result in algebraic graph theory explicitly diagonalizes the Laplacian of the $n$-cube $C(n)$  and yields, using the Matrix-Tree theorem, an explicit formula for $c(C(n))$. In this paper we explicitly block diagonalize the Laplacian of the $q$-analog $C_q(n)$ of $C(n)$ and use this, along with the Matrix-Tree theorem, to give a positive combinatorial formula for $c(C_q(n))$. We also explain how setting $q=1$ in the formula for $c(C_q(n))$ recovers the formula for $c(C(n))$.

Sign in / Sign up

Export Citation Format

Share Document