International Journal of Mathematics Trends and Technology
Volume 14 | Number 1 | Year 2014 | Article Id. IJMTT-V14P503 | DOI : https://doi.org/10.14445/22315373/IJMTT-V14P503
A graph is said to be a neighbourly irregular graph (or simply an NI graph) if every pair of its adjacent vertices have distinct degrees. Let G be a simple graph of order n. Let NI(G) denote the set of all NI graphs in which G is an induced subgraph. The neighbourly regular strength of G is denoted by NRS(G) and is defined as the minimum positive integer k for which there is an NI graph in NI(G) of order n+k. In this paper, we show that NRS(G) ≤ 2 for any bipartite graph G. In addition, we show that NRS(T) is either 0 or 1 for any tree T.
[1] Yousef Alavi, Alfred J Boals, Gary Chartrand, Ortrud R.Oellermann and Paul Erdos, k- path irregular graphs, Congressus Numeratium, 65 (1988), 201-210.
[2] Yousef Alavi, F.Buckley, M.Shamula and S.Ruiz, Highly irregular m-chromatic graphs, Discrete Mathematics, 72(1988), 3-13.
[3] Yousef Alavi, Gary Chartrand, F.R.K.Chung, Paul Erdos, R.L.Graham, Ortrud R.Oellermann, Highly irregular graphs, Journal of Graph Theory, 11 (1987), 235-249.
[4] Selvam Avadayappan and M.Muthuchelvam, Neighbourly regular strength of a graph, ARS combinatoria, Canada (To appear).
[5] Selvam Avadayappan and M.Muthuchelvam, A special NI graph, International Journal of Advanced Scientific and Technical Research Issue 4, Vol 1, (2014), 814-822.
[6] Selvam Avadayappan and M.Muthuchelvam, More results on neighbourly regular strength of a graph. (Submitted).
[7] Selvam Avadayappan, P.Santhi and R.Sridevi, Some results on neighbourly irregular graphs, Acta Ciencia Indica, Vol XXXIIM, No. 3 (2006), 1007-1012.
[8] Selvam Avadayappan, P.Santhi, Neighbourly irregular product graphs, Mathematics Computing and Modeling, 96-101.
[9] Selvam Avadayappan, P.Santhi, Some results on neighbourhood highly irregular graphs, ARS Combinatoria, 98(2011), 299-314.
[10] R.Balakrishnan and K.Ranganathan, A Text Book of Graph Theory, Springer, NewYork (2000).
[11] R.Balakrishnan and A.Selvam, k-neighbourhood regular graphs, Proceedings of the National Workshop on Graph Theory and its Applications, (1996), 35-45.
[12] S.Gnaana Bhragsam and S.K.Ayyaswamy, Neighbourly irregular graphs, Indian Journal of Pure and Applied Mathematics, 35(3) (March 2004), 389-399.
[13] Ebrahim Salehi, On P3-degree of graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, 62 (2007), 45-51.
[14] A. Selvam, Highly irregular bipartite graphs, Indian Journal of Pure and Applied Mathematics, 27(6) (June 1996), 527-536.
[15] V.Swaminathan and A.Subramanian, Neighbourhood highly irregular graphs, International Journal of Management and Systems 8(2) (May-August 2002), 227-231
Selvam Avadayappan , M.Muthuchelvam, "Neighbourly Regular Strength of Bipartite Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 14, no. 1, pp. 17-23, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V14P503
PDF 
Abstract 
Keywords 
References 
Citation