On H-irregularity strengths of G-amalgamation of graphs
Work
Year: 2017
Type: article
Abstract: A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting H-covering admits an H-irregular... more
Institutions Government College University, Lahore, Technical University of Košice, Government College University, Faisalabad
Cites: 20
Cited by: 3
Related to: 10
FWCI: 0.192
Citation percentile (by year/subfield): 57.56
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond