Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Hedetniemi, Jason T."'
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.
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:
Opuscula Mathematica. 2023, Vol. 43 Issue 2, p173-183. 11p.
Autor:
Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice, Phillips, Nicholas
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics September 2018
Autor:
Hedetniemi Jason T.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 4, Pp 615-628 (2015)
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of
Externí odkaz:
https://doaj.org/article/30bfe7301fc14cbbb9d686bfbdd88a4f
Autor:
Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice A., Mohan, Raghuveer
Publikováno v:
ETSU Faculty Works.
A dominating set in a graph G = (V,E) is a set S ⊆ V such that every vertex not in S is adjacent to at least one vertex in S. A coalition in a graph G consists of two disjoint sets V1, V2 ⊂ V neither of which is a dominating set but whose union V
Externí odkaz:
https://dc.etsu.edu/etsu-works-2/577
https://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p442.pdf
https://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p442.pdf
Autor:
Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice, Phillips, Nicholas
Publikováno v:
ETSU Faculty Works.
Let (Formula presented.) be a graph. For two disjoint sets of vertices (Formula presented.) and (Formula presented.), set (Formula presented.) dominates set (Formula presented.) if every vertex in (Formula presented.) is adjacent to at least one vert
Externí odkaz:
https://dc.etsu.edu/etsu-works/9116
https://dc.etsu.edu/cgi/viewcontent.cgi?article=10382&context=etsu-works
https://dc.etsu.edu/cgi/viewcontent.cgi?article=10382&context=etsu-works
Autor:
Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice, Phillips, Nicholas
Publikováno v:
ETSU Faculty Works.
Let G = (V,E) be a graph. The transitivity of a graph G, denoted Tr(G), equals the maximum order k of a partition x = {Vi,of V such that for every i,j, 1 i j k, Vi dominates Vj. We consider the transitivity in many special classes of graphs, includin
Externí odkaz:
https://dc.etsu.edu/etsu-works/9942
Autor:
Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice A., Mohan, Raghuveer
Publikováno v:
ETSU Faculty Works.
A coalition in a graph G =(V, E) consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set of G but whose union V1 ∪ V2 is a dominating set of G.A coalition partition in a graph G of order n = |V| is a vertex partiti
Externí odkaz:
https://dc.etsu.edu/etsu-works/9711
Autor:
Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice A., Mohan, Raghuveer
Publikováno v:
ETSU Faculty Works.
A coalition in a graph (Formula presented.) consists of two disjoint sets of vertices V 1 and V 2, neither of which is a dominating set but whose union (Formula presented.) is a dominating set. A coalition partition in a graph G of order (Formula pre
Externí odkaz:
https://dc.etsu.edu/etsu-works/9246