Minimum Total Irregularity of Totally Segregated Trees

Jorry T.F.; Dr Parvathy K.S.

doi:https://doi.org/10.14445/22315373/IJMTT-V50P522

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 50 | Number 3 | Year 2017 | Article Id. IJMTT-V50P522 | DOI : https://doi.org/10.14445/22315373/IJMTT-V50P522

Minimum Total Irregularity of Totally Segregated Trees

Jorry T.F., Dr Parvathy K.S.

Abstract

A tree, in which any two adjacent vertices have distinct degrees, is a Totally Segregated Tree (TST).

Keywords

Totally Segregated Tree; Total Irregularity; Minimum Total Irregularity; Maximum degree; Degree sequence.

References

[1] D. E. Jackson and R. Entringer, (1986) Totally Segregated Graphs, Congress. Numer., Vol. 55, 159-165
[2] Gary Chartrand and Ping Zhang, (2008) Chromatic Graph Theory, Boca Raton, London, New York: A Chapman and Hall Book,
[3] H. Abdo and D. Dimitrov, (2015). The Total irregularity of a Graph. Discrete Mathematics and Theoretical Computer Science, Vol.16 (No.1), 201-206.
[4] Jorry T. F. and Parvathy K. S. (2015),Uniformly Segregated Tree, Bulletin of Kerala Mathematical Association, Vol 12 (No.2), 135-143.
[5] M. O. Albertson ,(1997) The Irregularity of a graph, Ars.Combin. Vol.46, 219-225.
[6] Yingxue Zhu, Lihua You and Jieshan Yang, (2016). The Minimal Total Irregularity of Some Classes of Graphs. Filomat, Vol.30 (No.5),1203-1211.
[7] Y. Alavi, G. Chartrand, F. R. K. Chung, P. Erdos, R. L. Graham and O. R. Ollermann,(1987) Highly Irregular Graphs. Journal of Graph Theory, Vol. 11 (No.2), 235-249.

Citation :

Jorry T.F., Dr Parvathy K.S., "Minimum Total Irregularity of Totally Segregated Trees," International Journal of Mathematics Trends and Technology (IJMTT), vol. 50, no. 3, pp. 139-146, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V50P522