Results 21 to 30 of about 1,022,735 (236)
On the diameter of dot-critical graphs [PDF]
Opuscula Mathematica, 2009 A graph G is \(k\)-dot-critical (totaly \(k\)-dot-critical) if \(G\) is dot-critical (totaly dot-critical) and the domination number is \(k\). In the paper [T. Burtona, D. P.
Doost Ali Mojdeh, Somayeh Mirzamani
doaj +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
Binding number and path-factor critical deleted graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A graph G is called a [Formula: see text]-factor deleted graph if G – e has a [Formula: see text]-factor for any [Formula: see text] A graph G is [Formula: see text]-factor critical deleted if for every subset [Formula: see text] with [Formula: see text]
Yuan Chen, Guowei Dai
doaj +1 more source
Eternal Domination: Criticality and Reachability
Discussiones Mathematicae Graph Theory, 2017 We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached.
Klostermeyer William F. +1 more
doaj +1 more source
Critical $$(P_5,dart)$$-Free Graphs
, 2023 Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. Let $P_t$ be the path on $t$ vertices. A dart is the graph obtained from a diamond by adding a new vertex and making it adjacent to exactly one vertex with degree 3 in the diamond.
Xia, Wen +3 more
openaire +3 more sources
Split-critical and uniquely split-colorable graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Tınaz Ekim +2 more
doaj +1 more source
Counting Hamiltonian Cycles in 2-Tiled Graphs
Mathematics, 2021 In 1930, Kuratowski showed that K3,3 and K5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface.
Alen Vegi Kalamar +2 more
doaj +1 more source
Uniqueness and minimal obstructions for tree-depth [PDF]
, 2015 A k-ranking of a graph G is a labeling of the vertices of G with values from {1,...,k} such that any path joining two vertices with the same label contains a vertex having a higher label.
Barrus, Michael D., Sinkovic, John
core +3 more sources
Critical phenomena in exponential random graphs [PDF]
, 2013 The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence between particle
A. Rinaldo +14 more
core +1 more source
Critical percolation on random regular graphs [PDF]
, 2018 We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known results for fixed $d\
Joos, Felix, Perarnau, Guillem
core +4 more sources