On edge irregularity strength of different families of graphs
From MaRDI portal
Publication:6118270
DOI10.22199/ISSN.0717-6279-5873OpenAlexW4388922917MaRDI QIDQ6118270
Muhammad Imran, Unnamed Author, Murat Cancan, Yasir Ali, Unnamed Author
Publication date: 21 March 2024
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22199/issn.0717-6279-5873
edge irregularity strengthirregular assignmentirregularity strengthsnake graphspendant edges\(B_n\) graphlinear phenylene graph \(PH_n\)
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total edge irregularity strength of generalized prism
- On edge irregularity strength of graphs
- Irregular labelings of helm and sun graphs
- On the edge irregularity strength of corona product of cycle with isolated vertices
- Irregular total labellings of generalized Petersen graphs
- On the total vertex irregularity strength of trees
- On irregular total labellings
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- A new upper bound for the total vertex irregularity strength of graphs
- Irregularity strength of trees
- On edge irregular total labeling of categorical product of two cycles
- A New Upper Bound for the Irregularity Strength of Graphs
- On the irregularity strength of trees
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
- Edge irregularity strength of certain families of comb graph
- On the edge irregularity strength of grid graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- Total Vertex Irregularity Strength of Dense Graphs
- Total edge irregularity strength of trees
This page was built for publication: On edge irregularity strength of different families of graphs