Results 11 to 20 of about 3,013 (185)
The Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices
Journal of MathematicsTopological indices are widely used molecular structure descriptors in chemistry and pharmaceutics, which help analyze and predict the physicochemical properties and biological activity of compounds.
Zhenhua Su, Zikai Tang
doaj +2 more sources
Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter
Journal of MathematicsFor a connected graph G and two real numbers a,b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where VG represent the vertex set of graph G, dGv denotes the degree of vertex v, and ecGv is the eccentricity of v in G ...
Mesfin Masre
doaj +2 more sources
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
Unicyclic Graphs with the Fourth Extremal Wiener Indices
Journal of Chemistry, 2020 A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang +3 more
doaj +1 more source
On Variable Sum Exdeg Indices of Quasi-Tree Graphs and Unicyclic Graphs
Discrete Dynamics in Nature and Society, 2020 In this work, by using the properties of the variable sum exdeg indices and analyzing the structure of the quasi-tree graphs and unicyclic graphs, the minimum and maximum variable sum exdeg indices of quasi-tree graphs and quasi-tree graphs with perfect ...
Xiaoling Sun, Jianwei Du
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
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
Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
Journal of Graph Theory, Volume 102, Issue 1, Page 67-85, January 2023., 2023 Abstract Motivated by a Gan–Loh–Sudakov‐type problem, we introduce the regular Turán numbers, a natural variation on the classical Turán numbers where we restrict ourselves to the class of regular graphs. Among other results, we prove a striking supersaturation version of Mantel's theorem in the case of a regular host graph of odd order.
Stijn Cambie +2 more
wiley +1 more source
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
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