Results 51 to 60 of about 3,013 (185)
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
Extremal Permanents of Laplacian Matrices of Unicyclic Graphs
AxiomsThe extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable.
Tingzeng Wu +2 more
doaj +1 more source
On the Absolute Sum of Chromatic Polynomial Coefficient of Graphs
International Journal of Mathematics and Mathematical Sciences, 2011 The absolute sum of chromatic polynomial coefficient of forest, q-tree, unicyclic graphs, and quasiwheel graphs, are determined in this paper.
Shubo Chen
doaj +1 more source
Atom-bond connectivity index and diameter of graphs
Journal of Hebei University of Science and Technology, 2016 For further study of the numerous nice properties of topological indices in physical and chemical fields, it is worth considering the relation between a degree-based index and a distance-based index.
Lin WU, Yumei HU
doaj +1 more source
Sharp thresholds for constraint satisfaction problems and homomorphisms
, 2008 We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary constraint satisfaction
Hatami, Hamed, Molloy, Michael
core +2 more sources
Edge colouring line graphs of unicyclic graphs
Discrete Applied Mathematics, 1992 A characterization of line graphs of unicyclic graphs is established, and it is proved that the line graph \(G\) of a unicyclic graph is in class 1 unless \(G\) is an odd cycle and an optimal edge colouring of the line graph of a unicyclic graph can be computed in time \(O(| E|)\) (note that the chromatic index problem is known to be \(NP\)-complete ...
Cai, Leizhen, Ellis, John A.
openaire +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
The inertia of weighted unicyclic graphs [PDF]
, 2013 Let $G_w$ be a weighted graph. The \textit{inertia} of $G_w$ is the triple $In(G_w)=\big(i_+(G_w),i_-(G_w), $ $ i_0(G_w)\big)$, where $i_+(G_w),i_-(G_w),i_0(G_w)$ are the number of the positive, negative and zero eigenvalues of the adjacency matrix $A ...
Feng, Lihua +2 more
core
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
Some Results on the Independence Polynomial of Unicyclic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source