Results 71 to 80 of about 580,793 (206)
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
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 number of independent sets in unicyclic graphs [PDF]
, 2005 In this paper, we determine upper and lower bounds for the number of independent sets in a unicyclic graph in terms of its order. This gives an upper bound for the number of independent sets in a connected graph which contains at least one cycle.
Pedersen, Anders Sune +1 more
core +1 more source
Computing the vertex separation of unicyclic graphs
Information and Computation, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John A. Ellis, Minko Markov
openaire +2 more sources
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
Selection of an Optimal Warehouses Using Global Regular Domination in Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.Let G = (V, E) be a simple graph. A subset S of V (G) is said to be global dominating set if S is a dominating set of the given graph G and its complement G. A subset whose induced subgraph is regular in G is also regular in G. A dominating set D of V (G) is called a regular dominating set if hSi is regular. In this article, we introduce global regular
R. Sundareswaran +6 more
wiley +1 more source
Stress in Directed Graphs: A Generalization of Graph Stress
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.In graph theory, centrality measures are used to identify the most important or influential nodes within a network. Stress centrality is one such measure, which helps quantify how “stressed” a node is within the overall graph structure based on the number of shortest paths that pass through it. Stress centrality provides a more thorough assessment of a
K. V. Madhumitha +4 more
wiley +1 more source
A note on the minimum reduced reciprocal Randic index of n-vertex unicyclic graphs
Kuwait Journal of Science, 2017 Recent studies show that the reduced reciprocal Randi? (RRR) index possesses the second-best correlating ability amongthe several well known topological indices.
Akbar Ali, Akhlaq A. Bhatti
doaj
The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights
Discrete Dynamics in Nature and Society, 2018 The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs ...
Young Chel Kwun +4 more
doaj +1 more source
Estrada Index and Some Properties of Partially Signed Graphs [PDF]
Mathematics Interdisciplinary ResearchA signed graph is a graph with signed edges. Recently, a special graph consisting of signed and unsigned edges has been introduced and is called a partially signed graph.
Shila Razavi, Gholam Fath-Tabar
doaj +1 more source