Open AccessSupport Neighbourly Edge Irregular Graphs
Author(s) -
N. R. Santhi Maheswari*,
K. Amutha
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.c6878.098319
Subject(s) - combinatorics , mathematics , enhanced data rates for gsm evolution , graph , pathwidth , computer science , artificial intelligence , line graph
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.