A graph G is totally segregated if   whenever  The totally segregated polynomial of a graph G of order n is given by where t(k) is the number of totally segregated subgraphs of G of order k. In this paper, characterizations of a totally segregated subgraph of a certain graph are provided. These characterizations are used to determine the totally segregated polynomials.

totally segregated graph, totally segregated polynomial.

Received: September 21, 2023;  Accepted: November 10, 2023; Published: November 22, 2023

How to cite this article: Aziz B. Tapeing, Ladznar S. Laja, Javier Hassan and Hounam B. Copel, Totally segregated polynomial of graphs, Advances and Applications in Discrete Mathematics 40(2) (2023), 213-223. http://dx.doi.org/10.17654/0974165823067

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] Y. Alavi, G. Chartrand, F. R. K. Chung, P. Erdos, R. L. Graham and O. R. Ollermann, Highly irregular graphs, J. Graph Theory 11(2) (1987), 235-249.
[2] D. E. Jackson and R. Entringer, Totally segregated graphs, Congr. Numer. 55 (1986), 159-165.
[3] T. F. Jorry and K. S. Parvathy, Uniformly segregated tree, Bull. Kerala Math. Assoc. 12(2) (2015), 135-143.
[4] T. F. Jorry and K. S. Parvathy, Minimum total irregularity of totally segregated trees, International Journal of Mathematics Trends and Technology 50(3) (2017), 139-146.
[5] T. F. Jorry, Minimum size of co-segregated graph, Advances and Applications in Discrete Mathematics 32 (2022), 91-112.
[6] A. B. Tapeing and L. S. Laja, Co-segregated polynomial of graphs, Advances and Applications in Discrete Mathematics 40(1) (2023), 101-112.
[7] Ladznar S. Laja and Rosalio G. Artes, Jr., Convex subgraphs polynomials of the join and composition of graphs, International Journal of Mathematical Analysis 10 (2016), 515-529.
[8] P. M. Shivaswamy, Independent domination polynomial in graphs, IJSIMR 2(9) (2014), 755-763.
[9] A. B. Tapeing and L. S. Laja, Co-segregated polynomial of graphs, Advances and Applications in Discrete Mathematics 40(1) (2023), 101-112.
[10] A. Vijayan and T. Anitha, Connected total domination polynomials of graphs, International Journal of Mathematical Archive 5(11) (2014), 127-136.