A Note on Support Neighbourly Irregular Graphs

In any graph G, the support of a vertex is the sum of degrees of its neighbours. A connected graph G is said to be support neighbourly irregular (or simply SNI), if no two adjacent vertices in G have same support. In this paper, the necessary and sufficient conditions for some known families of grap...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical combinatorics 2018-11, p.197-206
Hauptverfasser: Avadayappan, Selvam, Bhuvaneshwari, M, Sinthu, R
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In any graph G, the support of a vertex is the sum of degrees of its neighbours. A connected graph G is said to be support neighbourly irregular (or simply SNI), if no two adjacent vertices in G have same support. In this paper, the necessary and sufficient conditions for some known families of graphs to be SNI have been discussed.
ISSN:1937-1055
1937-1047