POWER-3 HERONIAN MEAN LABELING OF GRAPHS

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2955

Full metadata record

DC Field	Value	Language
dc.contributor.author	M, Kaaviya Shree	-
dc.contributor.author	K, Sharmilaa	-
dc.date.accessioned	2023-06-07T10:27:27Z	-
dc.date.available	2023-06-07T10:27:27Z	-
dc.date.issued	2020-04	-
dc.identifier.issn	2249 – 8958	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/2955	-
dc.description.abstract	Abstract: Let be an undirected graph having vertices and edges. Now, defining a function say, is called Power-3 Heronian Mean Labeling of a graph if we could able to label the vertices with dissimilar elements from such that it induces an edge labeling defined as, is dissimilar for all the edges (i,e.) It intimates that the dissimilar vertex labeling induces a dissimilar edge labeling on the graph. The graph which owns Power-3 Heronian Mean Labeling is called an Power-3 Heronian Mean Graph. In this, we have advocated the Power-3 Heronian Mean Labeling of some standard graphs like Path, Comb, Caterpillar, Triangular Snake, Quadrilateral Snake and Ladder.	en_US
dc.language.iso	en_US	en_US
dc.subject	Power-3 Heronian Mean Labeling	en_US
dc.subject	Power-3 Heronian Mean Graph	en_US
dc.subject	Path	en_US
dc.subject	Comb	en_US
dc.subject	Caterpillar	en_US
dc.subject	Triangular Snake	en_US
dc.subject	Quadrilateral Snake	en_US
dc.subject	Ladder	en_US
dc.title	POWER-3 HERONIAN MEAN LABELING OF GRAPHS	en_US
dc.type	Article	en_US
Appears in Collections:	International Journals

Files in This Item:

File	Description	Size	Format
POWER-3 HERONIAN MEAN LABELING OF GRAPHS.docx		10.44 kB	Microsoft Word XML	View/Open