Header menu link for other important links
Total domination in certain nanotori
, , R. Sundara Rajan
Published in Charles Babbage Research Centre
Volume: 2020
Issue: 112
Pages: 87 - 94
A set S of vertices in a graph G is said to be a dominating set if every vertex in V(G) \Sis adjacent to some vertex in S. A dominating set S is called a total dominating set if each vertex of V(G) is adjacent to some vertex in S. Molecules arranging themselves into predictable patterns on silicon chips could lead to microprocessors with much smaller circuit elements. Mathematically, assembling in predictable patterns is equivalent to packing in graphs. In this paper, we determine the total domination number for certain nanotori using packing as a tool. © 2020 Charles Babbage Research Centre. All rights reserved.
About the journal
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
PublisherCharles Babbage Research Centre