On Group Distance Graph Evaluation

dc.contributor.authorAttlah Abbas
dc.contributor.authorFA22-RMT-010
dc.contributor.authorDr Hani Shaker
dc.contributor.authorLHR TP 9342
dc.date.accessioned2026-03-17T06:57:02Z
dc.date.issued2024-03-17
dc.description.abstractGraph help us for building the interconnection network that are required by systems. The unique graph labeling help us to ensure the functionality of these networks.In this research we have discuss the labeling of certain graphs and how we develope the labeling pattern for these graphs.We have used modulo group combinatorial techniques to find out the labeling schemes.By using elements from modulo group we have define group distance and distance magic labeling. We have calculate the weight of vertices and magic constant of graphs by finding the labeling of direct product of prism graph and cycle graph Pn × C4 under modulo group Z8n and Pn × Cm under modulo group Zm × Z2n ∀ n = 3 and m =≥ 4
dc.identifier.urihttps://repository.cuilahore.edu.pk/handle/123456789/2899
dc.language.isoen
dc.publisherLibrary Information Services COMSATS University Lahore Campus
dc.relation.ispartofseriesLHR TP 9342
dc.subjectDepartment of Mathematics
dc.subjectMathematics
dc.subjectFA22
dc.subjectGraph Evaluation
dc.subjectinterconnection network
dc.subjectcombinatorial techniques
dc.titleOn Group Distance Graph Evaluation
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Attlah Abbas Thesis.pdf
Size:
1.47 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
319 B
Format:
Item-specific license agreed to upon submission
Description:

Collections