On Statistical Tools in Finding Equitable Antimagic Labeling of Complete Graphs

Title

On Statistical Tools in Finding Equitable Antimagic Labeling of Complete Graphs

Creator

Puthussery A.; Sahul Hamid I.; Chelladurai X.

Description

Graph theory is a branch of mathematics that deals with representation of graphs with vertices and edges. Graph labeling is the assignment of integer labels to either vertices or edges. For a given graph G= (V, E), an edge-weighting is a function f:E(G)?{1,2,3,..,|E(G)|}. For a vertex v of G, let Wf(v) denotes the sum of edge-weights appearing on the edges incident at v under the edge-weighting f. A bijective edge-weighting f of G is said to be an equitable antimagic labeling (EAL) of G if |Wf(u) - Wf(v) | ? 1 for any pair of adjacent vertices u and v of G. A graph admitting an EAL is called an equitable antimagic graph (EAG). In this paper, the characterization of complete graphs Kn, for n? 6 is dealt using an algorithmic approach. 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Source

Lecture Notes in Networks and Systems, Vol-190, pp. 985-995.

Date

2021-01-01

Publisher

Springer Science and Business Media Deutschland GmbH

Subject

Edge labeling; Equitable antimagic complete graphs; Standard deviation

Coverage

Puthussery A., CHRIST (Deemed to be University), Bengaluru, India; Sahul Hamid I., The Madura College, Madurai, 11, India; Chelladurai X., CHRIST (Deemed to be University), Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 23673370; ISBN: 978-981160881-0

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1007/978-981-16-0882-7_89

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85112165767&doi=10.1007%2f978-981-16-0882-7_89&partnerID=40&md5=f8c47c8d0e99c6c8e32d1ef9849c1e58