On Equitable Coloring of Certain Graphs

Simple item page
dc.contributor.authorAhmed Muhammad (CIIT/FA20-BSM-022/LHR), Sohail Abu Haraira (CIIT/SP20-BSM-013/LHR)
dc.contributor.authorDr. M. Faisal Nadeem
dc.contributor.authorLHR TP 9912
dc.date.accessioned2026-01-06T15:01:40Z
dc.date.issued2024
dc.description.abstractIn this project, we explore several fundamental concepts in graph theory, focusing primarily equitable edge coloring. An equitable edge coloring of a graph is a proper edge coloring for which the difference between any two color classes is at most one. The minimum cardinality of G for such coloring is called equitable edge chromatic number.
dc.identifier.urihttps://repository.cuilahore.edu.pk/handle/123456789/284
dc.language.isoen
dc.publisherLibrary Information Services, COMSATS University Islamabad, Lahore Campus
dc.relation.ispartofseriesLHR TP 9912
dc.subjectDepartment of Mathematics
dc.subjectFA20
dc.subjectMathematics
dc.subjectEquitable
dc.subjectColoring
dc.subjectCertain Graphs
dc.subjectDr. M. Faisal Nadeem
dc.titleOn Equitable Coloring of Certain Graphs
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Haraira and Ahmed FYP final wpdf ----.pdf
Size:
922.8 KB
Format:
Adobe Portable Document Format
Download

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:
Download

Collections

Final Year Projects (FYPs) - Undergraduates