On some classes of equitable irregular graphs

Title

On some classes of equitable irregular graphs

Creator

Puthussery A.; Hamid I.S.

Description

Graph labeling techniques are used by data scientists to represent data points and their relationships with each other. The segregation/sorting of similar datasets/points are easily done using labeling of vertices or edges in a graph. An equitable irregular edge labeling is a function $$f: E(G) \rightarrow N$$ (not necessarily be injective) such that the vertex sums of any two adjacent vertices of $$G$$ differ by at most one, where vertex sum of a vertex is the sum of the labels under $$f$$ of the edges incident with that vertex. A graph admitting an equitable irregular edge labeling is called an equitable irregular graph (EIG). In this paper, more classes of equitable irregular graphs are presented. We further generalize the concept of equitable irregular edge labeling to $$k$$-equitable irregular edge labeling by demanding the difference of the vertex sum of adjacent vertices to be $$k \ge 1$$. The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2021.

Source

Lecture Notes in Networks and Systems, Vol-132, pp. 281-288.

Date

2021-01-01

Publisher

Springer

Subject

Datasets; Edge labeling; Equitable irregular graph; k-equitable irregular edge labeling

Coverage

Puthussery A., CHRIST Deemed to be University, Bengaluru, India; Hamid I.S., The Madura College, Madurai, 11, India

Rights

Restricted Access

Relation

ISSN: 23673370

Format

Online

Language

English

Type

Book chapter

Identifier

https://doi.org/10.1007/978-981-15-5309-7_30

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090372456&doi=10.1007%2f978-981-15-5309-7_30&partnerID=40&md5=19e8439f52aa1587b11019d4a26dadbb