Results 1 to 10 of about 6,957 (218)
The Nullity of Bicyclic Signed Graphs [PDF]
Let \Gamma be a signed graph and let A(\Gamma) be the adjacency matrix of \Gamma. The nullity of \Gamma is the multiplicity of eigenvalue zero in the spectrum of A(\Gamma).
Cheng B +7 more
core +5 more sources
Further Results on the Nullity of Signed Graphs [PDF]
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we apply the coefficient theorem on the characteristic polynomial of a signed graph and
Yu Liu, Lihua You
doaj +5 more sources
Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance [PDF]
Let G=V,E be a connected graph. The resistance distance between two vertices u and v in G, denoted by RGu,v, is the effective resistance between them if each edge of G is assumed to be a unit resistor.
Wenjie Ning, Kun Wang, Hassan Raza
doaj +2 more sources
On the Hosoya Indices of Bicyclic Graphs with Small Diameter [PDF]
Let G be a graph. The Hosoya index of G, denoted by zG, is defined as the total number of its matchings. The computation of zG is NP-Complete. Wagner and Gutman pointed out that it is difficult to obtain results of the maximum Hosoya index among tree ...
Tingzeng Wu, Yong Yu
doaj +2 more sources
Bicyclic molecular graphs with the greatest energy [PDF]
The molecular graph Qn is obtained by attaching hexagons to the end vertices of the path graph Pn-12. Earlier empirical studies indicated that Qn has greatest energy among all bicyclic n-vertex (molecular) graphs.
IVAN GUTMAN +2 more
doaj +5 more sources
On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings [PDF]
The graph with the largest signless Laplacian spectral radius among all bicyclic graphs with perfect matchings is determined.
Jing-Ming Zhang +2 more
doaj +2 more sources
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest Laplacian eigenvalues of G. In this paper, we determine the bicyclic graph with maximum S 2 ( G ) $S_{2}(G)$ among all bicyclic graphs of order n, which confirms the
Yirong Zheng +3 more
doaj +2 more sources
On the Extremal Weighted Mostar Index of Bicyclic Graphs [PDF]
Let G be a simple connected graph with edge set E(G) and vertex set V(G). The weighted Mostar index of a graph G is defined as w+Mo(G)=∑e=uv∈E(G)(dG(u)+dG(v))|nu(e)−nv(e)|, where nu(e) denotes the number of vertices closer to u than to v for an edge uv ...
Yuwei He, Mengmeng Liu
doaj +2 more sources
On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs [PDF]
For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as Equation (1). In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index.
Bin Yang +4 more
doaj +2 more sources
LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES
The graph in this research is a simple and connected graph with as vertex set and as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana +5 more
doaj +2 more sources

