On cycle-irregularity strength of ladders and fan graphs

On cycle-irregularity strength of ladders and fan graphs

<p class="p1">A simple graph <em>G</em> = (<em>V</em>(<em>G</em>),<em>E</em>(<em>G</em>)) admits an <em>H</em>-covering if every edge in <em>E</em>(<em>G</em>) belongs to at least one subg...

Full description

Bibliographic Details
Main Authors: Faraha Ashraf, Martin Baca, Andrea Semanicova-Fenovcikova, Suhadi Wido Saputro
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2020-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
total $h$-irregular labeling, total cycle-irregularity strength, ladder, fan graph
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/449

Internet

https://www.ejgta.org/index.php/ejgta/article/view/449

Similar Items