Zobrazeno 1 - 10
of 488
pro vyhledávání: '"HAYNES, TERESA"'
Autor:
Haynes, Teresa W., Henning, Michael A.
Publikováno v:
In Discrete Applied Mathematics 15 December 2024 358:457-467
Autor:
Haynes, Teresa W.1 haynes@etsu.edu, Henning, Michael A.2 mahenning@uj.ac.za
Publikováno v:
Opuscula Mathematica. 2024, Vol. 44 Issue 4, p543-563. 21p.
Autor:
Haynes Teresa W., Henning Michael A.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 35-53 (2023)
Let G be a graph with vertex set V. A subset S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distanc
Externí odkaz:
https://doaj.org/article/91ae7f491f714726ac790cc9d7c060e6
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
HAYNES, TERESA W.1 haynes@etsu.edu, HEDETNIEMI, JASON T.2 jhedetniemi@fau.edu, HEDETNIEMI, STEPHEN T.3 hedet@clemson.edu, MOHAN, RAGHUVEER4 alice.mcrae@gmail.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2023, Vol. 43 Issue 4, p931-946. 16p.
Autor:
Haynes, Teresa W.1,2 haynes@etsu.edu, Hedetniemi, Jason T.3 jhedetniemi@fau.edu, Hedetniemi, Stephen T.4 hedet@clemson.edu, McRae, Alice A.5 alice.mcrae@gmail.com, Mohan, Raghuveer5 mohanr@appstate.edu
Publikováno v:
Communications in Combinatorics & Optimization. 2023, Vol. 8 Issue 2, p423-430. 8p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 633-645 (2021)
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S. The restrained domination number
Externí odkaz:
https://doaj.org/article/d995801dbe824214ba2206aed1735822