Results 21 to 30 of about 6,957 (218)
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 symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number
AIMS Mathematics, 2021 Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. In a molecular graph, the vertices represent the atoms and the edges represent the chemical bonds in the terms of graph ...
Xiaoling Sun, Yubin Gao, Jianwei Du
doaj +1 more source
Regularity of bicyclic graphs and their powers [PDF]
Journal of Algebra and Its Applications, 2019 Let [Formula: see text] be the edge ideal of a bicyclic graph [Formula: see text] with a dumbbell as the base graph. In this paper, we characterize the Castelnuovo–Mumford regularity of [Formula: see text] in terms of the induced matching number of [Formula: see text]. For the base case of this family of graphs, i.e.
Cid-Ruiz, Yairon +3 more
openaire +4 more sources
Non-Singular Trees, Unicyclic Graphs and Bicyclic Graphs
Applied Mathematics, 2019 We called graph G non-singular if adjacency matrix A (G) of G is non-singular. A connected graph with n vertices and n-1, n and n+1 edges are called the tree, the unicyclic graph and the bicyclic graph. Respectively, as we all know, each connected bicyclic graph must contain ∞(a,s,b) or θ(p,l,q) as the induced subgraph.
Haicheng Ma, Danyang Li, Chengling Xie
openalex +3 more sources
On bicyclic graphs with maximal Graovac-Ghorbani index [PDF]
Match Communications in Mathematical and in Computer Chemistry, 2023 Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [MATCH Commun. Math. Comput. Chem. 86 (2021) 429-448] conjectured a sharp lower and upper bounds to the Graovac-Ghorbani index for all bicyclic graphs. Motivated by their nice work, in this paper we determine the maximal Graovac-Ghorbani index of bicyclic ...
Rui Song, Saihua Liu, Jianping Ou
openalex +2 more sources
Laplacian integral signed graphs with few cycles
AIMS Mathematics, 2023 A connected graph with n vertices and m edges is called k-cyclic graph if k=m−n+1. We call a signed graph is Laplacian integral if all eigenvalues of its Laplacian matrix are integers.
Dijian Wang, Dongdong Gao
doaj +1 more source
Applied Mathematics Letters, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grünewald, Stefan, Stevanović, Dragan
openaire +1 more source
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
The bounds of the energy and Laplacian energy of chain graphs
AIMS Mathematics, 2021 Let $G$ be a simple connected graph of order $n$ with $m$ edges. The energy $\varepsilon(G)$ of $G$ is the sum of the absolute values of all eigenvalues of the adjacency matrix $A$.
Yinzhen Mei, Chengxiao Guo, Mengtian Liu
doaj +1 more source
Iota energy orderings of bicyclic signed digraphs [PDF]
Transactions on Combinatorics, 2021 The concept of energy of a signed digraph is extended to iota energy of a signed digraph. The energy of a signed digraph $S$ is defined by $E(S)=\sum_{k=1}^n|{Re}(z_k)|$, where ${Re}(z_k)$ is the real part of eigenvalue $z_k$ and $z_k$ is the ...
Xiuwen Yang, Ligong Wang
doaj +1 more source