Search Results - "Desormeaux, Wyatt J."

Partitioning the vertices of a cubic graph into two total dominating sets by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study cubic graphs whose vertex…”
Get full text

Domination Defect in Graphs: Guarding With Fewer Guards by Das, Angsuman, Desormeaux, Wyatt J.

“…In this paper, we introduce a new graph parameter called the domination defect of a graph. The domination number γ of a graph G is the minimum number of…”
Get full text

Restrained Domination in Self-Complementary Graphs by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A self-complementary graph is a graph isomorphic to its complement. A set of vertices in a graph is a restrained dominating set if every vertex in ) \ is…”
Get full text

Partitioning the Vertices of a Graph into Two Total Dominating Sets by Delgado, Pamela, Desormeaux, Wyatt J., Haynes, Teresa W.

“…A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study graphs whose vertex set can…”
Get full text

Relating the annihilation number and the total domination number of a tree by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The total domination number γt(G) is the…”
Get full text

Total Domination in Graphs with Diameter 2 by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A., Yeo, Anders

“…The total domination number γt(G) of a graph G is the minimum cardinality of a set S of vertices, so that every vertex of G is adjacent to a vertex in S. In…”
Get full text

Domination Parameters of a Graph and its Complement by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A dominating set in a graph is a set of vertices such that every vertex in ( ) \ is adjacent to at least one vertex in , and the domination number of is the…”
Get full text

Connected Domination Stable Graphs Upon Edge Addition by Desormeaux, Wyatt J., Haynes, Teresa W., van der Merwe, Lucas

“…A set S of vertices in a graph G is a connected dominating set of G if S dominates G and the subgraph induced by S is connected. We study the graphs for which…”
Get full text

Bounds on the Global Domination Number by Desormeaux, Wyatt J., Gibson, Philip E., Haynes, Teresa W.

“…A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both G and its complement Ḡ. The minimum cardinality of a global…”
Get full text

An extremal problem for total domination stable graphs upon edge removal by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine…”
Get full text

A Note on Non-Dominating Set Partitions in Graphs by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G…”
Get full text

Total domination changing and stable graphs upon vertex removal by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating…”
Get full text

Total domination critical and stable graphs upon edge removal by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S . The minimum cardinality of a total…”
Get full text

Edge lifting and total domination in graphs by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…Let u and v be vertices of a graph G , such that the distance between u and v is two and x is a common neighbor of u and v . We define the edge lift of uv off…”
Get full text

Total domination stable graphs upon edge addition by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S . The minimum cardinality of a total dominating…”
Get full text

Domination edge lift critical trees by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…Let uxv be an induced path with center x in a graph G. The edge lifting of uv off x is defined as the action of removing edges ux and vx from the edge set of…”
Get full text

Improved bounds on the domination number of a tree by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number γ(G) of G is the…”
Get full text

Lower bounds on the total domination number of a graph by Desormeaux, Wyatt J., Henning, Michael A.

“…A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to a vertex in S . The minimum cardinality of a total dominating…”
Get full text

Bounds on the connected domination number of a graph by Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.

“…A subset S of vertices in a graph G=(V,E) is a connected dominating set of G if every vertex of V∖S is adjacent to a vertex in S and the subgraph induced by S…”
Get full text

Relating the annihilation number and the 2-domination number of a tree by Desormeaux, Wyatt J., Henning, Michael A., Rall, Douglas F., Yeo, Anders

“…A set S of vertices in a graph G is a 2-dominating set if every vertex of G not in S is adjacent to at least two vertices in S. The 2-domination numberγ2(G) is…”
Get full text