Results 21 to 30 of about 1,782 (193)
On the inverse mostar index problem for molecular graphs [PDF]
Transactions on CombinatoricsMostar indices are recently proposed distance-based graph invariants, that already have been much investigated and found applications. In this paper, we investigate the inverse problem for Mostar indices of unicyclic and bicyclic molecular graphs.
Liju Alex, Ivan Gutman
doaj +1 more source
Mathematics, 2023 Degree sequence measurements on graphs have attracted a lot of research interest in recent decades. Multiplying the degrees of adjacent vertices in graph Ω provides the multiplicative first Zagreb index of a graph.
Sakander Hayat, Farwa Asmat
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 Estrada index of bicyclic graphs
Discrete Applied Mathematics, 2015 Let $G$ be a simple graph of order $n$, let $λ_1(G),λ_2(G),...,λ_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\sum_{i=1}^{n}e^{λ_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.
Long Wang 0013, Yi-Zheng Fan, Yi Wang
openaire +3 more sources
On minimum algebraic connectivity of graphs whose complements are bicyclic
Open Mathematics, 2019 The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
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
$G$-designs for the connected triangular bicyclic graphs with nine edges [PDF]
Transactions on CombinatoricsA $G$-design of order $n$ is a decomposition of the complete graph $K_n$ into isomorphic copies of $G$. We show that if $G$ is a connected bicyclic graph with nine edges containing two triangles, a $G$-design of order $n$ exists whenever $n \equiv 0,1 ...
Bryan Freyberg +4 more
doaj +1 more source
On the nullity of bicyclic graphs
Linear Algebra and its Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Shengbiao +2 more
openaire +2 more sources
The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Mathematics, 2023 Let G be a connected graph; the edge Mostar index Moe(G) of G is defined as Moe(G)=∑e=uv∈E(G)|mu(e)−mv(e)|, where mu(e) and mv(e) denote the number of edges in G that are closer to vertex u than to vertex v and the number of edges that are closer to ...
Hui Wang, Mengmeng Liu
doaj +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