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. Key words: Neighbourly irregular graphs, Neighbourly edge irregular fuzzy graphs, support neighbourly irregular graphs, Support neighbourly edge irregular graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Recent Technology and Engineering (IJRTE)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
