Super ( a , d ) - C 4 -antimagicness of book graphs

Let \(G=(V,E)\) be a~finite simple graph with \(|V(G)|\) vertices and \(|E(G)|\) edges. An edge-covering of \(G\) is a family of subgraphs \(H_1, H_2, \dots, H_t\) such that each edge of \(E(G)\) belongs to at least one of the subgraphs \(H_i\), \(i=1, 2, \dots, t\). If every subgraph \(H_i\) is iso...

Full description

Bibliographic Details
Main Authors: Muhammad Awais Umar, Malik Anjum Javed, Mujtaba Hussain, Basharat Rehman Ali
Format: Article
Language:English
Published: Ptolemy Scientific Research Press 2018-05-01
Series:Open Journal of Mathematical Sciences
Subjects:
Online Access:https://openmathscience.com/super-ad-c_4-antimagicness-of-book-graphs-2/