Results 51 to 60 of about 771 (82)

Criticality of Switching Classes of Reversible 2-Structures Labeled by an Abelian Group

Discussiones Mathematicae Graph Theory, 2017
Let V be a finite vertex set and let (𝔸, +) be a finite abelian group. An 𝔸-labeled and reversible 2-structure defined on V is a function g : (V × V) \ {(v, v) : v ∈ V } → 𝔸 such that for distinct u, v ∈ V, g(u, v) = −g(v, u).
Belkhechine Houmem, Ille Pierre, Woodrow Robert E.   +2 more
doaj   +1 more source

Conflict-Free Vertex-Connections of Graphs

Discussiones Mathematicae Graph Theory, 2020
A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang, Zhang Yingying, Zhu Xiaoyu, Mao Yaping, Zhao Haixing, Jendrol’ Stanislav   +5 more
doaj   +1 more source

(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs

Discussiones Mathematicae Graph Theory, 2022
The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi, Gözüpek Didem, Ekinci Gülnaz Boruzanlı   +2 more
doaj   +1 more source

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, Borowiecki Piotr, Drgas-Burchardt Ewa, Sidorowicz Elżbieta   +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, Daniel B.D., Guidry R., Paul Wright W.   +3 more
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ı, Bujtás Csilla   +1 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

Strongly Unichord-Free Graphs

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