Results 1 to 10 of about 295 (159)
Null decomposition of unicyclic graphs [PDF]
Discrete Applied Mathematics, 2020 arXiv admin note: text overlap with arXiv:1907 ...
Daniel Jaume, Vilmar Trevisan
exaly +3 more sources
Regularity of the edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs [PDF]
HeliyonWe compute the Castelnuovo-Mumford regularity of the quotient rings of edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs.
Fatima Tul Zahra +2 more
doaj +2 more sources
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
Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index [PDF]
HeliyonThe 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 +2 more
doaj +2 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
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
Unicyclic components in random graphs [PDF]
Journal of Physics A: Mathematical and General, 2004 4 pages, 2 ...
E. Ben-Naim, Paul L. Krapivsky
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
The Signless Laplacian Estrada Index of Unicyclic Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G.
Hamid Reza Ellahi +3 more
doaj +1 more source
Binomial edge ideals of unicyclic graphs [PDF]
International Journal of Algebra and Computation, 2021 Let [Formula: see text] be a connected graph on the vertex set [Formula: see text]. Then [Formula: see text]. In this paper, we prove that if [Formula: see text] is a unicyclic graph, then the depth of [Formula: see text] is bounded below by [Formula: see text]. Also, we characterize [Formula: see text] with [Formula: see text] and [Formula: see text].
openaire +2 more sources