Asha Rani,, A (2025) MOBIUSCORDIALLABELINGOFSOMESNAKEGRAPHS. MOBIUSCORDIALLABELINGOFSOMESNAKEGRAPHS, 14 (2). pp. 332-337.

[thumbnail of MOBIUS CORDIAL LABELING OF SOME SNAKE GRAPHS.pdf] Text
MOBIUS CORDIAL LABELING OF SOME SNAKE GRAPHS.pdf - Published Version
Download (277kB)

Abstract

The study of labelling vertices or edges of graphs with real numbers, subject to
certain constraints, has numerous real-world applications across various fields. The concept of
Mobius cordial labelling based on Mobius function, which was introduced by us, have been
investigated to certain family of graphs. In Mobius cordial labelling, the integers-1, 0 and 1 are
assigned to the edges of a graph G(V,E) through an evaluating function defined on the vertices
V and the mobius function defined on the edges E, ensuring the cordiality conditions are met.
In this paper we are going to investigate this labelling technique for some snake related graphs
and few other graphs.

Item Type: Article
Uncontrolled Keywords: Keywords and phrases: Graph, Mobius cordial labelling, Injective function, Mobius cordial graphs.
Divisions: PSG College of Arts and Science > Department of Mathematics
Depositing User: Dr. B Sivakumar
Date Deposited: 10 Dec 2025 07:27
Last Modified: 10 Dec 2025 07:27
URI: https://ir.psgcas.ac.in/id/eprint/2570

Actions (login required)

View Item
View Item