Strongly Multiplicative Labeling of some Standard Graphs

Autor:	T M Chhaya, K K Kanani
Rok vydání:	2017
Předmět:	Combinatorics Discrete mathematics Strongly regular graph Graph labeling law Friendship graph Edge-graceful labeling Line graph Multiplicative function Graph law.invention Mathematics
Zdroj:	International Journal of Mathematics and Soft Computing. 7:13
ISSN:	2319-5215 2249-3328
DOI:	10.26708/ijmsc.2017.1.7.02
Popis:	In this paper we investigate strongly multiplicative labeling of some standard graphs. We prove that helm, flower graph, fan, friendship graph and bistar are strongly multiplicative. We also prove that gear graph, double triangular snake, double fan and double wheel are strongly multiplicative.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cbb8225316dc6c0ba1a6aa1d2e68061f https://doi.org/10.26708/ijmsc.2017.1.7.02 Zobrazit plný text záznamu