Date of Publication :12th July 2017
Abstract: A graphic sequence = ( , , ) 1 n ï° d ï‹ d is potentially 4 2 2 K ï€ K K -graphic if it has a a realization containing an 4 2 2 K ï€ K K as a subgraph where 4 K is a wheel graph on four vertices and 2 2 K K is a set of independent edges. In this paper, we find the smallest degree sum such that every n -term graphical sequence contains 4 2 2 K ï€ K K as a subgraph
Reference :
Will Updated soon