Results 31 to 40 of about 963 (204)
Characterization of Extremal Unicyclic Graphs Using F-Coindex
Complexity, 2021 The study of forgotten index and coindex for the molecular structures of some special chemical graphs (compounds and drugs) has proven significant in medical and pharmaceutical drug design fields by making reliable statistical conclusion about biological
Muhammad Imran +3 more
doaj +1 more source
Smarandachely t-path step signed graphs [PDF]
, 2010 Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +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
Generating graceful unicyclic graphs from a given forest
AKCE International Journal of Graphs and Combinatorics, 2020 Acharya (1982) proved that every connected graph can be embedded in a graceful graph. The generalization of this result that, any set of graphs can be packed into a graceful graph was proved by Sethuraman and Elumalai (2005). Recently, Sethuraman et al. (
G. Sethuraman, V. Murugan
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
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