Abstract
In this paper, we introduce a new family of irregular graphs called support neighbourly edge irregular graphs based on degree in edge sense. In any graph, the support of an edge is the sum of the edge degrees of its neighbours. A graph is said to be support neighbourly edge irregular(or simply SNEI), if any two adjacent edges have different support. Basic properties of theses graphs are studied. A necessary and sufficient condition for a graph to be SNEI has been obtained and several methods to construct SNEI graph from other graphs have been discussed.
Author supplied keywords
Cite
CITATION STYLE
Santhi Maheswari, N. R., & Amutha, K. (2019). Support neighbourly edge irregular graphs. International Journal of Recent Technology and Engineering, 8(3), 5329–5332. https://doi.org/10.35940/ijrte.C6878.098319
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
