A Cram on the Prolonged Network of Star Grid
K. Thiagarajan1, P. Mansoor2

1K. Thiagarajan, Academic Research, Jeppiaar Engineering College, Chennai (Tamil Nadu), India.
2P. Mansoor, Research and Development Centre, Bharathiar University, Coimabatore (Tamil Nadu), India.
Manuscript received on 25 March 2019 | Revised Manuscript received on 04 April 2019 | Manuscript Published on 27 April 2019 | PP: 385-387 | Volume-7 Issue-6S2 April 2019 | Retrieval Number: F9077047619/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Nowadays graph theory has indispensable role in many applications of networking. The graph structures are very useful in the modelling of pair wise relations between various nodes of a network. The star graph is a network graph for which various results have been already established. The introduction of semi nodes to each edge in a non trivial star graph Sn on n ≥ 2 nodes; will result in a new network graph, denoted by ‘ n S . This paper attempts to study some properties of the graph ‘ n S in terms of graph theoretic parameters, namely maximum degree Δ, chromatic number χ, harmonious chromatic number h, domination number γ.
Keywords: Expanded Star Graph, Chromatic Number, Harmonious Chromatic Number, Domination Number and Semi Node.
Scope of the Article: Grid Networking/ Computing