On Distance Antimagic Labeling of Graphs and their Products

dc.contributor.guideMinirani S.
dc.coverage.spatial
dc.creator.researcherYadav Anjali
dc.date.accessioned2025-12-10T11:26:17Z
dc.date.available2025-12-10T11:26:17Z
dc.date.awarded2025
dc.date.completed2025
dc.date.registered2023
dc.description.abstractIn graph theory, antimagic labeling refers to assigning distinct positive integers to each newlinevertex and its edges in order to have a unique sum of labels incident to each vertex. newlineThis characteristic facilitates the analysis and differentiation of graphs.The study of antimagic newlinelabeling is primarily driven by its applications in network design, cryptography, newlineand resource allocation, where distinct identifiers or configurations serve a vital function newlinein upholding security and optimising performance. One of the main advantages of newlineantimagic labeling is that it uses edge labels to encode information, which helps with newlinegraph representation, data encoding, and combinatorial problems. The study on antimagic newlinelabeling naturally paves way for distance antimagic labeling which takes into newlineaccount the spatial interactions between vertices. This development demonstrates the newlinetheoretical depth and practical utility of antimagic labeling concepts. newlineThe initial component of the thesis examines the presence and absence of distance antimagic newlinelabeling in particular categories of graphs. This study uses computer tools to newlinefind distance antimagic labeling for two types of graphs: the Kneser graph and the bipartite newlineKneser graph. It also investigates distance antimagic labeling in certain classes newlineof graphs that are disconnected and gives results of labeling in graphs related to cycles. newlineIn the next section, distance antimagic labeling on various basic graph products is discussed. newlineThe graph products taken into consideration are the Cartesian product, tensor newlineproduct, lexicographic product, and strong product. Graph products are utilized in many newlineother fields and are crucial to graph theory. Graph products are used in network design... newline
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions
dc.format.extenti-vi;114p
dc.identifier.researcherid0000-0002-3820-7686
dc.identifier.urihttp://hdl.handle.net/10603/679652
dc.languageEnglish
dc.publisher.institutionApplied Mathematics
dc.publisher.placeMumbai
dc.publisher.universityNarsee Monjee Institute of Management Studies
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordDistance Magic Labeling; Distance Antimagic Labeling; Inclusive Distance Antimagic Labeling; Cryptology; Encryption; Decryption.
dc.subject.keywordEngineering
dc.subject.keywordEngineering and Technology
dc.subject.keywordEngineering Multidisciplinary
dc.titleOn Distance Antimagic Labeling of Graphs and their Products
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 14
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
90.01 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
2.91 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_contents.pdf
Size:
183.87 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
35.25 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter 1.pdf
Size:
393.62 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: