Results 131 to 140 of about 963 (204)

On the Laplacian coefficients of unicyclic graphs with prescribed matching number

, 2011
Let ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. We give some transformations of connected graphs that decrease all Laplacian coefficients ck(G), we then derive the unicyclic graphs with the
Tan, Shang-wang, Shang-wang Tan
core   +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

Study of Some Interesting Topics in the Theory of Graphs

, 2010
Not ...
Dani, Nilish A.
core  

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

Local Multiset Dimension of Amalgamation Graphs. [PDF]

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

Omega invariant of the line graphs of unicyclic graphs

, 2020
A recently introduced graph invariant Ω(G) for a graph G is proven to have several nice applications in Graph Theory and Com-binatorics. This number gives direct information on the number of components, realizability, cyclicness, connectedness, chords ...
Güneş, Aysun Yurttaş, Togan, Müge, Delen, Sadik, Cangül, İsmail Naci   +3 more
core  

QSPR analysis of anticancer drugs using the Euler-Sombor index and theoretical insights on its minimum value for unicyclic graphs. [PDF]

Sci Rep
Shetty S, Rakshith BR, Udupa NVS.
europepmc   +1 more source

The smallest Hosoya index of unicyclic graphs with given diameter

, 2012
The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including the empty edge set, of this graph. Let ${\cal{U}}_{n,d}$ be the set of connected unicyclic (molecular) graphs of order n with diameter d. In this paper we
Xu, Kexiang, Kexiang Xu
core  

Epidemic models with discrete state structures. [PDF]

Physica D, 2021
Liu S, Li MY.
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