Results 11 to 20 of about 298 (175)

On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree [PDF]

Journal of Inequalities and Applications, 2017
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj   +2 more sources

Regularity of the edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs [PDF]

Heliyon
We compute the Castelnuovo-Mumford regularity of the quotient rings of edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs.
Fatima Tul Zahra, Muhammad Ishaq, Sarah Aljohani   +2 more
doaj   +2 more sources

Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index [PDF]

Heliyon
The Misbalance Rodeg (MR) index stands out among the 148 discrete Adriatic indices demonstrating considerable predictive capabilities in evaluations carried out by the International Academy of Mathematical Chemistry.
Nasrin Dehgardi, Mahdieh Azari, Yilun Shang   +2 more
doaj   +2 more sources

The Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices

Journal of Mathematics
Topological indices are widely used molecular structure descriptors in chemistry and pharmaceutics, which help analyze and predict the physicochemical properties and biological activity of compounds.
Zhenhua Su, Zikai Tang
doaj   +2 more sources

Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter

Journal of Mathematics
For a connected graph G and two real numbers a,b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where VG represent the vertex set of graph G, dGv denotes the degree of vertex v, and ecGv is the eccentricity of v in G ...
Mesfin Masre
doaj   +2 more sources

Burning Numbers of t-unicyclic Graphs [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2021
Given a graph $G$, the burning number of $G$ is the smallest integer $k$ for which there are vertices $x_1, x_2,\ldots,x_k$ such that $(x_1,x_2,\ldots,x_k)$ is a burning sequence of $G$. It has been shown that the graph burning problem is NP-complete, even for trees with maximum degree three, or linear forests. A $t$-unicyclic graph is a unicycle graph
Ruiting Zhang, Yingying Yu, Huiqing Liu
openaire   +3 more sources

Incidence and Laplacian matrices of wheel graphs and their inverses

The American Journal of Combinatorics, 2023
It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj   +1 more source

Null decomposition of unicyclic graphs [PDF]

Discrete Applied Mathematics, 2020
arXiv admin note: text overlap with arXiv:1907 ...
L. Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan   +4 more
openaire   +2 more sources

Unicyclic components in random graphs [PDF]

Journal of Physics A: Mathematical and General, 2004
4 pages, 2 ...
Ben-Naim, E., Krapivsky, P. L.
openaire   +2 more sources

New Diagonal Graph Ramsey Numbers of Unicyclic Graphs

Theory and Applications of Graphs, 2023
Grossman conjectured that R(G, G) = 2 · |V (G)| − 1, for all simple connected unicyclic graphs G of odd girth and |V (G)| ≥ 4. In this note, we prove his conjecture for various classes of G containing a triangle.
Richard M. Low, Ardak Kapbasov
doaj   +1 more source