Results 21 to 30 of about 314 (174)
The spread of the unicyclic graphs
European Journal of Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yarong Wu, Jinlong Shu
openaire +2 more sources
Journal of Mathematics, 2022 The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G.
Luozhong Gong, Weijun Liu
doaj +1 more source
On the inverse mostar index problem for molecular graphs [PDF]
Transactions on CombinatoricsMostar indices are recently proposed distance-based graph invariants, that already have been much investigated and found applications. In this paper, we investigate the inverse problem for Mostar indices of unicyclic and bicyclic molecular graphs.
Liju Alex, Ivan Gutman
doaj +1 more source
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
Journal of Inequalities and Applications, 2016 A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013) and Liu et al. (Electron. J.
Shu-Guang Guo +3 more
doaj +1 more source
A survey and a new class of graceful unicylic graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a
Max Pambe Biatch’ +2 more
doaj +1 more source
Spectral radius and extremal graphs for class of unicyclic graph with pendant vertices
Advances in Mechanical Engineering, 2017 In this article, we research on the spectral radius of extremal graphs for the unicyclic graphs with girth g mainly by the graft transformation and matching and obtain the upper bounds of the spectral radius of unicyclic graphs.
Lu Zhi +5 more
doaj +1 more source
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
Special Matrices, 2021 Recently, the extremal problem of the spectral radius in the class of complements of trees, unicyclic graphs, bicyclic graphs and tricyclic graphs had been studied widely.
Chen Chaohui +2 more
doaj +1 more source
Online graph exploration on trees, unicyclic graphs and cactus graphs [PDF]
Information Processing Letters, 2021 We study the problem of exploring all vertices of an undirected weighted graph that is initially unknown to the searcher. An edge of the graph is only revealed when the searcher visits one of its endpoints. Beginning at some start node, the searcher's goal is to visit every vertex of the graph before returning to the start node on a tour as short as ...
openaire +3 more sources
All unicyclic graphs of order n with locating-chromatic number n-3
Indonesian Journal of Combinatorics, 2021 Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (⩾ 6) and having locating-chromatic number n-3.
Edy Tri Baskoro, Arfin Arfin
doaj +1 more source
On the Maximum Sombor Index of Unicyclic Graphs with a Fixed Girth
Journal of Mathematics, 2022 Let G be a graph having the set of edges EG. Represent by dGu the degree of a vertex u of G. The Sombor (SO) index of G is defined as SOG=∑uv∈EGdGu2+dGv2. The length of a shortest cycle in a graph G is known as the girth of G.
B. Senthilkumar +5 more
doaj +1 more source