Results 31 to 40 of about 2,717 (193)
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
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, 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
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
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 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
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
, 2014 The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule":
A Sebö +19 more
core +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
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