M. Yamuna, K. Karthika, "G* Properties -Without G* Construction," WSEAS Transactions on Mathematics, vol. 15, pp. 312-324, 2016, DOI:
M. Yamuna, K. Karthika. G* Properties -Without G* Construction.
WSEAS Transactions on Mathematics. 2016;15:312-324.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 15, 2016
G* Properties -Without G* Construction
Authors: ,
Abstract: In any planar graph G there is a one to one correspondence between edges in G, its dual G∗. As the number of vertices and edges increase construction of G* is complicated, when graph G* is not required and only properties of G* is a need, determining properties of G* without actual construction of G* is comfortable. In this paper we determine the domination number of G*, G*, chromatic polynomial of G*, spanning tree of G*, number of spanning trees of G* from G. Determining the domination number of G*, G* using matrix representation is presented. MATLAB code for determining the same is also provided.
Pages: 312-324 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 15, 2016, Art. #30 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools