Abstract
In this paper we consider only graphs without loops and multiple edges. The product of two vertex disjoint graphs G 1 and G 2 is the graph obtained by joining each vertex of G 1 to each vertex of G 2. Given n and the sample graphs L 1,..., L λ, we shall consider those graphs on n vertices which contain no L i, as a subgraph and have maximum number of edges under this condition. These graphs will be called extremal graphs for the L i’s.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
