Keywords and phrases: segregated graph, co-segregated graph, minimum size of co-segregated graph, maximum size of co-segregated graph.
Received: October 8, 2022; Revised: October 30, 2022; Accepted: January 4, 2023; Published: January 28, 2023
How to cite this article: T. F. Jorry, On co-segregated graphs, Advances and Applications in Discrete Mathematics 37 (2023), 47-66. http://dx.doi.org/10.17654/0974165823011
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] J. Akiyama, H. Era and F. Harary, The regulation number of a graph, Publ. Inst. Math. (Beograd) 34 (1983), 3-5. [2] J. Akiyama and F. Harary, Regular graphs containing a given graph, Elem. Math. 38 (1982), 15-17. [3] Y. Alavi, J. Liu and J. Wang, Highly irregular digraphs, Discrete Math. 111 (1993), 3-10. [4] M. O. Albertson, The irregularity of a graph, Ars. Combin. 46 (1997), 219-225. [5] R. Balakrishnan and A. Selvem, k-neighbourhood regular graphs, Proceedings of the National Workshop on Graph Theory and its Applications, 1996, pp. 35-45. [6] F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, New York, 1990. [7] Gary Chartrand, Linda Lesniak and Ping Zhang, Graphs and Digraphs, Sixth Edition, A Chapman and Hall Book, Taylor and Francis Group, CRC Press, Boca Raton, London, New York, 2016. [8] D. E. Jackson and R. Entringer, Totally segregated graphs, Congress. Numer. 55 (1986), 159-165. [9] Z. Majcher and J. Michael, Degree sequence of highly irregular graphs, Discrete Math. 164 (1997), 225-236. [10] M. Randic, Characterization of molecular branching, Journal of the American Chemical Society 97 (1975), 6609-6615. [11] T. F. Jorry, Minimum size of co-segregated graph, Advances and Applications in Discrete Mathematics 32 (2022), 91-112. [12] D. Rautenbach and I. Schiermeyer, Extremal problems for imbalanced edges, Graphs Comb. 22 (2006), 103-111.
|