Non-Neighbour Irregular Graphs

Basavanagoud, B.; Ramane, H.S.; Desai, Veena R.

doi:10.18052/www.scipress.com/BMSA.15.1

BMSA > BMSA Volume 15 > Non-Neighbour Irregular Graphs

< Back to Volume

Non-Neighbour Irregular Graphs

Full Text PDF

Abstract:

A graph G is said to be non-neighbour irregular graph if no two nonadjacent vertices of G have same degree. This paper suggests the methods of construction of non-neighbour irregular graphs. This paper also includes a few properties possessed by these non-neighbour irregular graphs.

Info:

Periodical:

Bulletin of Mathematical Sciences and Applications (Volume 15)

Pages:

1-7

DOI:

https://doi.org/10.18052/www.scipress.com/BMSA.15.1

Citation:

B. Basavanagoud et al., "Non-Neighbour Irregular Graphs", Bulletin of Mathematical Sciences and Applications, Vol. 15, pp. 1-7, 2016

Online since:

May 2016

Authors:

B. Basavanagoud, H.S. Ramane, Veena R. Desai

Keywords:

Non-Neighbour Irregular Graph, Partition of an Integer

Export:

RIS, BibTeX, Text

Distribution:

Open Access

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

References:

[1] Y. Alavi, G. Chartrand, F. R. K. Chang, P. Erdos, H. L. Graham, O. R. Oellermann, Highly irregular graphs, J. Graph Theory. vol. 11, pp.235-249, (1987).

DOI: https://doi.org/10.1002/jgt.3190110214

[2] R. Balakrishnan, A. Selvam, K-neighbourhood regular graphs, Proc. of the National Seminar on Graph Theory, pp.35-45, (1996).

[3] S. G. Bhragsam, S. K. Ayyaswamy, Neighbourly irregular graphs, Indian J. pure appl. Math. vol. 35(3), pp.389-399, (2004).

[4] F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, (1969).

[5] V. R. Kulli, College Graph Theory, Vishwa International Publications, Gulbarga, India, (2012).

Show More Hide

Cited By:

This article has no citations.