Computing the edge irregularity strengths of chain graphs and the join of two graphs
From MaRDI portal
(Redirected from Publication:5009980)
Recommendations
- Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
- On edge irregularity strength of graphs
- On the edge irregularity strength of disjoint union of certain graphs.
- On the edge irregularity strength of disjoint union of star graph and subdivision of star graph.
- On edge irregularity strength of products of certain families of graphs with path P₂.
Cites work
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- Irregular Assignments of Trees and Forests
- Irregularity strength of trees
- On edge irregular total labeling of categorical product of two cycles
- On edge irregularity strength of graphs
- On graph irregularity strength
- On irregular total labellings
- On the edge irregularity strength of corona product of cycle with isolated vertices
- On the edge irregularity strength of corona product of graphs with paths
- On the irregularity strength of trees
- On the total vertex irregularity strength of trees
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- Total edge irregularity strength of strong product of two paths.
- Total vertex irregularity strength of disjoint union of Helm graphs
Cited in
(10)- Iterative algorithm for computing irregularity strength of complete graph.
- On cycle-irregularity strength of ladders and fan graphs
- On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices
- Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
- Computing edge irregularity strength of complete m-ary trees
- scientific article; zbMATH DE number 7765819 (Why is no real title available?)
- Edge and modular edge irregularity strength of some path related graphs
- Further results on edge irregularity strength of some graphs
- Computing edge irregularity strength of star and banana trees using algorithmic approach.
- Nonuniform subset graphs associated with any graph
This page was built for publication: Computing the edge irregularity strengths of chain graphs and the join of two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009980)