Back to Search
Start Over
Upper Bounds on Inclusive Distance Vertex Irregularity Strength.
- Source :
-
Graphs & Combinatorics . Nov2021, Vol. 37 Issue 6, p2713-2721. 9p. - Publication Year :
- 2021
-
Abstract
- An inclusive distance vertex irregular labeling of a graph G is an assignment of positive integers { 1 , 2 , ... , k } to the vertices of G such that for every vertex the sum of numbers assigned to its closed neighborhood is different. The minimum number k for which exists an inclusive distance vertex irregular labeling of G is denoted by dis ^ (G) . In this paper we prove that for a simple graph G on n vertices in which no two vertices have the same closed neighborhood dis ^ (G) ≤ n 2 . [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH labelings
*INTEGERS
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 37
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 153556143
- Full Text :
- https://doi.org/10.1007/s00373-021-02385-8