Abstract
1. Introduction and NotationWe consider finite undirected graphs without loops and multiple edges. Thevertex set of a graph G is denoted by V(G) and the edge set by E(G). Thenotation H ⊆ G means that H is a subgraph of G. The vertex induced (wewill say briefly: induced) subgraph H of G is denoted by H ≤G. We say thatG contains H whenever G contains a subgraph isomorphic to H. In general,we follow the notation and terminology of [5].Let I denote the set of all mutually nonisomorphic graphs. If P is anonempty subset of I, then P will also denote the property that a graph is
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
