Flash News
Welcome to IARC

Publisher Login

Latest News
Welcome to IARC- JCR Report

Submit your Journal to get IARC-JCRR Indexing and Impact Factor
 

Impact Factor calculated by IARC on the basis of Journal Citation Reference (JCR) Report.

 

Contact: iarcdpi@gmail.com

 

?-Splitting graphs
Selvam Avadayappan*, M. Bhuvaneshwari, B. Vijaya Lakshmi

Published in: International Journal of Scientific Review and Research in Engineering and Technology
Volume- 1, Issue-3, pp.84-101, Apr 2016
DPI :-> 16.10069.IJSRRET.2016.V1I3.84101.1306



Abstract
Let G(V, E) be a graph. The graph S(G) obtained from G by adding a new vertex for every vertex v ? V and joining to all neighbours of in G is called the splitting graph of G. Here, we introduce a new type of graphs called maximum independent splitting graphs or simply ?-splitting graphs. Let s1, s2, …..sp be the maximum independent sets in G. The ?-splitting graph, of a graph G is obtained by adding new vertices w1, w2, …..wp and joining to each vertex in Si in G where 1?i??. In this paper, we establish some results on ?-splitting graphs.

Key-Words / Index Term
Splitting graph, degree splitting graph, cosplitting graph, support splitting graph, ?-splitting graph.

How to cite this article
Selvam Avadayappan*, M. Bhuvaneshwari, B. Vijaya Lakshmi , “?-Splitting graphs”, International Journal of Scientific Review and Research in Engineering and Technology, 1, Issue-3, pp.84-101, Apr 2016. DPI:16.10069.IJSRRET.V1.I3.1306