Results 81 to 90 of about 412,655 (203)
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
Certain Aspects of Spectra of Unicyclic Graphs [PDF]
, 2006 Supervisor: Bhaba Kr. SarmaThis thesis aims at filling some conspicuous gaps in the study of spectra of unicyclic graphs, and answering some recent questions on relations between the structure of a unicyclic graph and the spectrum of its adjacency matrix.
Nath, Milan
core +1 more source
Unicyclic signed graphs with minimal energy
, 2017 A connected signed graph with n vertices is said to be unicyclic if its number of edges is n. The energy of a signed graph S of order n with eigenvalues x(1), x(2), ..., x(n) is defined as E(S)=Sigma(n)(j=1) |x(j)|. We obtain the integral representations
S. Pirzada +3 more
core +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
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
On Minimum Generalized Degree Distance Index of Cyclic Graphs
International Journal of Mathematics and Mathematical Sciences, 2023 Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +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
The smallest values of algebraic connectivity for unicyclic graphs [PDF]
, 2010 The algebraic connectivity of G is the second smallest eigenvalue of its Laplacian matrix. Let Un be the set of all unicyclic graphs of order n. In this paper, we will provide the ordering of unicyclic graphs in Un up to the last seven graphs according ...
Jianxi Li +5 more
core +1 more source
On unicyclic graphs of metric dimension 2 [PDF]
, 2017 A metric basis S of a graph G is the subset of vertices of minimum cardinality such that all other vertices are uniquely determined by their distances to the vertices in S. The metric dimension of a graph G is the cardinality of the subset S.
Dudenko, M., Oliynyk, B.
core +2 more sources
On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees
Journal of Mathematics, Volume 2025, Issue 1, 2025.Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif +5 more
wiley +1 more source