Results 11 to 20 of about 1,782 (193)
The Maximal Total Irregularity of Bicyclic Graphs [PDF]
In 2012, Abdo and Dimitrov defined the total irregularity of a graph G=(V,E) as irrtG=1/2∑u,v∈VdGu-dGv, where dGu denotes the vertex degree of a vertex u∈V.
Lihua You +3 more
doaj +3 more sources
On the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined as the sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math.
R. Rasi
doaj +2 more sources
Regularity of bicyclic graphs and their powers [PDF]
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
The nullity of bicyclic signed graphs [PDF]
Let Γbe a signed graph and let A(Γ) be the adjacency matrix of Γ. The nullity of Γis the multiplicity of eigenvalue zero in the spectrum of A(Γ). In this paper we characterize the signed graphs of order n with nullity n-2 or n-3, and introduce a graph transformation which preserves the nullity.
Fan, Yi-Zheng +2 more
openaire +2 more sources
On the index of unbalanced signed bicyclic graphs [PDF]
In this paper, we focus on the index ( largest eigenvalue) of the adjacency matrix of connected signed graphs. We give some general results on the index when the corresponding signed graph is perturbed. As applications, we determine the first five largest index among all unbalanced bicyclic graphs on n >= 36 vertices together with the corresponding ...
Changxiang He +3 more
openaire +2 more sources
The Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity [PDF]
The algebraic connectivity of a graph $G$ is the second smallest eigenvalue of its Laplacian matrix. Let $\mathscr{B}_n$ be the set of all bicyclic graphs of order $n$. In this paper, we determine the last four bicyclic graphs (according to their smallest algebraic connectivities) among all graphs in $\mathscr{B}_n$ when $n\geq 13$.
Jianxi Li, Ji-Ming Guo, Wai Chee Shiu
openaire +2 more sources
Let \(\lambda_2\) be the second largest eigenvalue of the adjacency matrix of a graph. Graphs having \(\lambda_2\leq 2\) are called reflexive graphs. Since this property is hereditary, these graphs may be represented through sets of maximal graphs. In this paper, authors continue their previous line of study and construct maximal bicyclic reflexive ...
Zoran Radosavljevic +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Grünewald, Dragan Stevanovic
openaire +1 more source
The first Dirichlet eigenvalue of bicyclic graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Guang-Jun, Zhang, Xiao-Dong
openaire +2 more sources
On Omega Index and Average Degree of Graphs
Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences.
Sadik Delen +3 more
doaj +1 more source

