Results 21 to 30 of about 3,013 (185)
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 In chemistry and medical sciences, it is essential to study the chemical, biological, clinical, and therapeutic aspects of pharmaceuticals. To save time and money, mathematical chemistry focuses on topological indices used in quantitative structure‐property relationship (QSPR) models to predict the properties of chemical structures.
Vignesh Ravi +6 more
wiley +1 more source
Some Characterizations and NP‐Complete Problems for Power Cordial Graphs
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 A power cordial labeling of a graph G = (V(G), E(G)) is a bijection f : V(G)⟶{1,2, …, |V(G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))n or f(v) = (f(u))n, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.
C. M. Barasara, Y. B. Thakkar, Akbar Ali
wiley +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
Local Fractional Strong Metric Dimension of Certain Complex Networks
Complexity, Volume 2023, Issue 1, 2023., 2023 Fractional variants of distance‐based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems. Complex networks are exceptional networks which exhibit significant topological features and have become quintessential research area in the field of computer science, biology, and mathematics.
Faiza Jamil +4 more
wiley +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
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 super vertex-graceful unicyclic graphs [PDF]
Czechoslovak Mathematical Journal, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Sin-Min, Leung, Elo, Ng, Ho Kuen
openaire +1 more source
Minor-obstructions for apex sub-unicyclic graphs [PDF]
Discrete Applied Mathematics, 2020 A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1$-apex sub-unicyclic graphs, i.e., the set of all minor minimal graphs that do not belong in this class.
Leivaditis, A. +5 more
openaire +4 more sources
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