Results 51 to 60 of about 305 (179)
AN ISOMORPHISM THEOREM FOR UNICYCLIC GRAPHS
Demonstratio Mathematica, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Contraharmonic Index: Extremal Results for Unicyclic Graphs and Bounds for General Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let G be a graph with edge set E(G). The degree of a vertex w in G is denoted by dw. The contraharmonic index of G is defined as CHG=∑uv∈EGdu+dv−1du2+dv2. In this paper, we investigate several properties of the contraharmonic index, including extremal results for unicyclic graphs of a given order, as well as bounds and the effects of an edge removal in
Abdulaziz Mutlaq Alotaibi +2 more
wiley +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
A New Kind of Dominated Coloring of Some Special Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.This paper introduces the concept of locating‐dominated coloring, a new graph coloring parameter that merges the properties of dominated coloring and locating coloring. For a connected graph G, a locating‐dominated coloring is defined as a proper dominated k‐coloring of G using an ordered partition of V(G) to k‐color classes Π = (C1, C2, …, Ck) such ...
F. Poryousefi +3 more
wiley +1 more source
, 2020 {"references": ["1.\tJ. Amalorpava Jerline, L. Benedict Michaelraj, On a conjecture of harmonic index and diameter of graphs, Kragujevac Journal of Mathematics, 40(1), (2016),73-78. 2.\tR. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Springer-Verlog, New York, 2000. 3.\tH. Deng, S. Balachandran, S. K. Ayyaswamy, Y. B.
I. Ignomary, S. Suganya
openaire +2 more sources
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
An Approach to the Extremal Inverse Degree Index for Families of Graphs with Transformation Effect
Journal of Chemistry, 2021 The inverse degree index is a topological index first appeared as a conjuncture made by computer program Graffiti in 1988. In this work, we use transformations over graphs and characterize the inverse degree index for these transformed families of graphs.
Muhammad Asif +4 more
doaj +1 more source
The largest eigenvalue of unicyclic graphs
Discrete Mathematics, 2007 The author shows that the largest eigenvalue of the adjacency matrix of a unicyclic graph with the maximum vertex degree \(\Delta\) is bounded from above by \(2\sqrt{\Delta-1}\), while the largest eigenvalue of its Laplacian matrix is bounded by \(\Delta+2\sqrt{\Delta-1}\), with equality in the first case holding for all cycles, and in the second case ...
openaire +2 more sources
Recognizing Trees From Incomplete Decks
Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley +1 more source
The Moran Process on a Random Graph
Random Structures &Algorithms, Volume 66, Issue 3, May 2025.ABSTRACT We study the fixation probability for two versions of the Moran process on the random graph Gn,p$$ {G}_{n,p} $$ at the threshold for connectivity. The Moran process models the spread of a mutant population in a network. Throughout the process, there are vertices of two types, mutants, and non‐mutants.
Alan Frieze, Wesley Pegden
wiley +1 more source