Results 41 to 50 of about 78 (61)
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +1 more source
Split Euler Tours In 4-Regular Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula puts su cient restrictions on plane graphs that one should be able to assert the existence of such tours in some cases; in particular we focus on split ...
Couch PJ +3 more
doaj +1 more source
The Graphs Whose Permanental Polynomials Are Symmetric
Discussiones Mathematicae Graph Theory, 2018 The permanental polynomial π(G,x)=∑i=0nbixn−i$\pi (G,x) = \sum\nolimits_{i = 0}^n {b_i x^{n - i} }$ of a graph G is symmetric if bi = bn−i for each i. In this paper, we characterize the graphs with symmetric permanental polynomials.
Li Wei
doaj +1 more source
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
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
On polyhedral graphs and their complements. [PDF]
Aequ Math, 2022 Maffucci RW.
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
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
Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs. [PDF]
J Math Biol, 2021 Richter H.
europepmc +1 more source