Results 21 to 30 of about 305 (179)
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
On the core of a unicyclic graph
Ars Mathematica Contemporanea, 2012 8 pages, 5 ...
Vadim E. Levit, Eugen Mandrescu
openaire +3 more sources
The local metric dimension of split and unicyclic graphs
Indonesian Journal of Combinatorics, 2022 A set W is called a local resolving set of G if the distance of u and v to some elements of W are distinct for every two adjacent vertices u and v in G. The local metric dimension of G is the minimum cardinality of a local resolving set of G.
Dinny Fitriani +3 more
doaj +1 more source
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
On the first and second Zagreb indices of quasi unicyclic graphs [PDF]
Transactions on Combinatorics, 2019 Let $G$ be a simple graph. The graph $G$ is called a quasi unicyclic graph if there exists a vertex $x \in V(G)$ such that $G-x$ is a connected graph with a unique cycle. Moreover, the first and the second Zagreb indices of $G$ denoted by $M_1(G)$
Majid Aghel +2 more
doaj +1 more source
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
On Critical Unicyclic Graphs with Cutwidth Four
AppliedMath, 2022 The cutwidth minimization problem consists of finding an arrangement of the vertices of a graph G on a line Pn with n=|V(G)| vertices in such a way that the maximum number of overlapping edges (i.e., the congestion) is minimized.
Zhenkun Zhang, Hongjian Lai
doaj +1 more source
Introducing New Exponential Zagreb Indices for Graphs
Journal of Mathematics, 2021 New graph invariants, named exponential Zagreb indices, are introduced for more than one type of Zagreb index. After that, in terms of exponential Zagreb indices, lists on equality results over special graphs are presented as well as some new bounds on ...
Nihat Akgunes, Busra Aydin
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