Irregular Coloring in Interconnection Networks

dc.contributor.guide	Radha R Iyer
dc.coverage.spatial
dc.creator.researcher	Shyama S
dc.date.accessioned	2026-02-12T11:20:17Z
dc.date.available	2026-02-12T11:20:17Z
dc.date.awarded	2025
dc.date.completed	2025
dc.date.registered	2018
dc.description.abstract	Coloring is one of the most important aspects of graph theory. Specially, graphs embedded on surfaces undergo three types of colorings: vertex colorings, edge colorings, and region colorings. When it comes to graph colorings, the vertex colorings have received the most attention and are the most widely used. A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices have the same color. A color class is the independent set of all vertices with a single color..... newline
dc.description.note
dc.format.accompanyingmaterial	None
dc.format.dimensions
dc.format.extent	xiv; 140
dc.identifier.researcherid	0000-0003-1882-8028
dc.identifier.uri	http://hdl.handle.net/10603/694990
dc.language	English
dc.publisher.institution	Department of Mathematics
dc.publisher.place	Coimbatore
dc.publisher.university	Amrita Vishwa Vidyapeetham University
dc.relation
dc.rights	university
dc.source.university	University
dc.subject.keyword	Mathematics:Coloring; Graph theory
dc.subject.keyword	Physical Sciences
dc.title	Irregular Coloring in Interconnection Networks
dc.title.alternative
dc.type.degree	Ph.D.