Results 21 to 30 of about 167 (150)
The first Dirichlet eigenvalue of bicyclic graphs [PDF]
Czechoslovak Mathematical Journal, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Guang-Jun, Zhang, Xiao-Dong
openaire +2 more sources
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Journal of Chemistry, 2021 A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set ...
Muhammad Rizwan +3 more
doaj +1 more source
On the Laplacian coefficients of bicyclic graphs
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang-Xiang He, Hai-Ying Shan
openaire +1 more source
On the Hosoya Indices of Bicyclic Graphs with Small Diameter
Journal of Chemistry, 2021 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 +1 more source
ARITHMETICAL RANK OF THE CYCLIC AND BICYCLIC GRAPHS [PDF]
Journal of Algebra and Its Applications, 2012 We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex, the arithmetical rank equals the projective dimension of the corresponding quotient ring.
BARILE, Margherita +3 more
openaire +5 more sources
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
Discrete Dynamics in Nature and Society, 2021 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n
Gaixiang Cai, Xing-Xing Li, Guidong Yu
doaj +1 more source
Kuwait Journal of Science, 2021 Mili\v{c}evi\'{c} \textit{et al.}, in 2004, introduced topological indices known as Reformulated Zagreb indices, where they modified Zagreb indices using the edge-degree instead of vertex degree.
Abhay Rajpoot, Lavanya Selvaganesh
doaj +1 more source
Further Results on the Nullity of Signed Graphs
Journal of Applied Mathematics, 2014 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 +1 more source
End-regularity of generalized bicycle graph
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G is called End-regular, if every endomorphism of G is regular as a monoid. In this article, we investigate End-regularity of bicycle graphs. Moreover, a generalization of bicycle graph is defined and gives a characterization of End-regular generalized bicycle graphs.
A. Rajabi, A. Erfanian, A. Azimi
openaire +2 more sources
Per-Spectral Characterizations of Bicyclic Networks
Journal of Applied Mathematics, 2017 Spectral techniques are used for the study of several network properties: community detection, bipartition, clustering, design of highly synchronizable networks, and so forth.
Tingzeng Wu, Huazhong Lü
doaj +1 more source