Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^n Graph

A total graph labeling is an assignment of integers to the union of vertices and edges to certain conditions. The labeling becomes D -distance vertex irregular total k-labeling when each vertex of G has a different weight (which is determined by D-distance neighborhood). The total distance vertex ir...

Full description

Bibliographic Details

Main Authors:	Ida, Wijayanti, Dian Eka, Wijayanti, Sugiyarto, Surono
Format:	Article
Language:	en
Published:	INTI International University 2022
Subjects:	Q Science (General) QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://eprints.intimal.edu.my/1662/1/jods2022_09.pdf http://eprints.intimal.edu.my/1662/ http://ipublishing.intimal.edu.my/jods.html
Tags:	Add Tag No Tags, Be the first to tag this record!