IJPAM: Volume 85, No. 4 (2013)
LEXICOGRAPHICAL PRODUCT OF COMPLETE GRAPHS
Department of Mathematics
Faculty of Applied Science
King Mongkut's University of Technology
North Bangkok, Bangkok, 10800, THAILAND
Abstract. Let γ(G) and γ'(G) be the domination number and edge domination number, respectively. The lexicographical Product G1•G2 of graph of G1 and G2 has vertex set V(G1 • G2)=V(G1) × V(G2) and edge set
Received: February 9, 2013
AMS Subject Classification: 05C69, 05C70, 05C76
Key Words and Phrases: lexicographical product, domination number, edge domination number
Download paper from here.
DOI: 10.12732/ijpam.v85i4.10 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395