Results 131 to 140 of about 828 (207)

Laplacian eigenvalue distribution for unicyclic graphs

Applied Mathematics and Computation
Let $G$ be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$.
Sunyo Moon, Seungkook Park
openaire   +3 more sources

Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]

Molecules, 2022
Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc   +1 more source

The inertia of unicyclic graphs and bicyclic graphs

Discussiones Mathematicae - General Algebra and Applications, 2013
Let G be a graph with n vertices and (G) be the matching number of G. The inertia of a graph G, In(G) = (n+;n ;n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let (G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G).
openaire   +1 more source

Some results on the ordering of the Laplacian spectral radii of unicyclic graphs

, 2008
A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A.
Liu, Ying, Shao, Jia-Yu, Yuan, Xi-Ying
core   +1 more source

On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]

Comput Intell Neurosci, 2022
Xu G, Sun Q, Liang Z.
europepmc   +1 more source

Regularity of Powers of Unicyclic Graphs

, 2018
Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper we prove that if $G$ is a unicyclic graph then for all $s \geq 1$ the regularity of $I(G)^s$ is exactly $2s+\text{reg}(I(G))-2$.
Alilooee, Ali, Kara, Selvi, Selvaraja, S.   +2 more
core  

The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two

Open Mathematics
The number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}.
Bai Yongqiang, Ma Hongping, Zhang Xia
doaj   +1 more source

On detour index of cycloparaphenylene and polyphenylene molecular structures. [PDF]

Sci Rep, 2021
Prabhu S, Nisha YS, Arulperumjothi M, Jeba DSR, Manimozhi V.   +4 more
europepmc   +1 more source

Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]

Entropy (Basel), 2022
Ali F, Rather BA, Din A, Saeed T, Ullah A.   +4 more
europepmc   +1 more source

Local Multiset Dimension of Amalgamation Graphs. [PDF]

F1000Res, 2023
Alfarisi R, Susilowati L, Dafik D, Prabhu S.   +3 more
europepmc   +1 more source