On generalized composed properties of generalized product graphs

Nopparat Pleanmani, Sayan Panma

Abstract


A property ℘ is defined to be a nonempty isomorphism-closed subclass of the class of all finite simple graphs. A nonempty set S of vertices of a graph G is said to be a ℘-set of G if G[S]∈ ℘. The maximum and minimum cardinalities of a ℘-set of G are denoted by M℘(G) and m℘(G), respectively. If S is a ℘-set such that its cardinality equals M℘(G) or m℘(G), we say that S is an M℘-set or an m℘-set of G, respectively. In this paper, we not only define six types of property ℘ by the using concepts of graph product and generalized graph product, but we also obtain M℘ and m℘ of product graphs in each type and characterize its M℘-set.


Keywords


independence; hereditary property; graphical property; product graph

Full Text:

PDF

DOI: http://dx.doi.org/10.19184/ijc.2022.6.2.5

References

B. Bollobás, Extremal graph theory, Academic Press, New York, 1978.

M. Borowiecki, I. Broere, M. Frick, P. Mikók and G. Semanišin, A survey of hereditary properties of graphs, Discuss. Math. Graph Theory., 17 (1997), 5--50.

D. Geller and S. Stahl, The chromatic number and other functions of the lexicographic product, J. Combin. Theory Ser. B, 19 (1975), 87--95.

W. Imrich and S. Klavzar, Product graphs, Wiley-Interscience, New York, 2000.

U. Knauer, Algebraic graph theory, De Gruyter, Berlin-Boston, 2011.

E. Mândrescu, Strongly perfect products of graphs, Czechoslovak Math. J., 41, 368--372.

N. Pleanmani and S. Panma, Partially composed property of generalized lexicographic product graphs, Discrete Math. Algorithms Appl., 9 (2007).

G. Ravindra and K. R. Parthasarathy, Perfect product graphs, Discrete Math., 20 (1977), 177--186.


Refbacks

  • There are currently no refbacks.


ISSN: 2541-2205

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJC Stats