Results 61 to 70 of about 107 (87)
Bipartite graphs with close domination and k-domination numbers
Open Mathematics, 2020 Let kk be a positive integer and let GG be a graph with vertex set V(G)V(G). A subset D⊆V(G)D\subseteq V(G) is a kk-dominating set if every vertex outside DD is adjacent to at least kk vertices in DD. The kk-domination number γk(G){\gamma }_{k}(G) is the
Ekinci Gülnaz Boruzanlı +1 more
doaj +1 more source
A [k, k+1]-Factor Containing a Given Hamiltonian Cycle
, 1998 We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k \Gamma 16 for even n and n 6k \Gamma 13 for odd n.
Mikio Kano, Cai Mao-cheng, Yanjun Li
core
On polyhedral graphs and their complements. [PDF]
Aequ Math, 2022 Maffucci RW.
europepmc +1 more source
Discussiones Mathematicae Graph Theory, 2019 Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly ...
McKee Terry A.
doaj +1 more source
Spectral dynamics of guided edge removals and identifying transient amplifiers for death-Birth updating. [PDF]
J Math Biol, 2023 Richter H.
europepmc +1 more source
Kaleidoscopic Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2017 For an r-regular graph G, let c : E(G) → [k] = {1, 2, . . . , k}, k ≥ 3, be an edge coloring of G, where every vertex of G is incident with at least one edge of each color.
Chartrand Gary, English Sean, Zhang Ping
doaj +1 more source
Further Exploration of an Upper Bound for Kemeny's Constant. [PDF]
Entropy (Basel)Kooij RE, Dubbeldam JLA.
europepmc +1 more source
Non-hyperbolicity in random regular graphs and their traffic characteristics
Open Mathematics, 2013 Tucci Gabriel
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches: