WebA Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex of the top row to the additional vertex (Lee 1985; Gallian 2011, p. 14). The (2,3)-Mongolian tent graph is isomorphic to the 3-gear graph. Mongolian tent graphs are graceful … http://www.imar.ro/journals/Mathematical_Reports/Pdfs/2024/1/11.pdf
A generalized study on Graceful labeling of Graphs
Webgraphs such as extended grids, Mongolian Tent etc. Labeling in graph theory has been one of the most fascinating and happening topics with a lot of variety and applications. … http://fs.unm.edu/IJMC/ANoteon3-RemainderCordialLabelingGraphs.pdf northeast clinical services danvers ma
Mongolian Tent Graph -- from Wolfram MathWorld
WebAug 5, 2024 · Radial Radio Mean Labeling of Mongolian Tent and Diamond Graphs Arputha Jose T1, M. Giridaran2 1. Research Scholar, Department of Mathematics, SSN College of Engineering, Kalavakkam, Chennai ... Webedges. Gee-Choon Lau et al. [9] constructed new super graceful graph, by deleting an edge and adding a new edge from super graceful graph under some conditions. They also obtained new super graceful graphs by attaching k pendent edges to a vertex of a super graceful graphs. In this thesis, we concentrate our work on construction and enumeration WebThe origin of the graph labeling problem is graceful labeling which was introduced by Rosa [11] in ... labeling behavior of prism, Mongolian tent, book, young tableau, K m × P 2, torus grids, n-cube. Also we have proved that if G 1 and G 2 are (p 1,q 1) and (p 2,q 2) graphs with q 1 ≥ p northeast clinton school district