TY - JOUR
T1 - On the independence and domination numbers of replacement product graphs
AU - Cummings, Jay
AU - Kelley, Christine A.
N1 - Publisher Copyright:
© 2016 Mathematical Sciences Publishers.
PY - 2016
Y1 - 2016
N2 - This paper examines invariants of the replacement product of two graphs in terms of the properties of the component graphs. In particular, we present results on the independence number, the domination number, and the total domination number of these graphs. The replacement product is a noncommutative graph operation that has been widely applied in many areas. One of its advantages over other graph products is its ability to produce sparse graphs. The results in this paper give insight into how to construct large, sparse graphs with optimal independence or domination numbers.
AB - This paper examines invariants of the replacement product of two graphs in terms of the properties of the component graphs. In particular, we present results on the independence number, the domination number, and the total domination number of these graphs. The replacement product is a noncommutative graph operation that has been widely applied in many areas. One of its advantages over other graph products is its ability to produce sparse graphs. The results in this paper give insight into how to construct large, sparse graphs with optimal independence or domination numbers.
KW - maximized independence number
KW - minimized domination number
KW - replacement product of a graph
KW - total domination number
UR - http://www.scopus.com/inward/record.url?scp=85134709823&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85134709823&partnerID=8YFLogxK
U2 - 10.2140/involve.2016.9.181
DO - 10.2140/involve.2016.9.181
M3 - Article
AN - SCOPUS:85134709823
SN - 1944-4176
VL - 9
SP - 181
EP - 194
JO - Involve
JF - Involve
IS - 2
ER -