Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs
From MaRDI portal
Publication:1634474
DOI10.3390/math6090142zbMath1401.05265OpenAlexW2888426797MaRDI QIDQ1634474
Publication date: 18 December 2018
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6090142
Applications of graph theory (05C90) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (17)
Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs ⋮ Vertex Szeged index of crystal cubic carbon structure ⋮ Modified eccentric descriptors of crystal cubic carbon ⋮ Topological properties of benzenoid, phenylenes and nanostar dendrimers ⋮ Irregularity of Sierpinski graph ⋮ On the M-polynomials and degree-based topological indices of an important class of graphs ⋮ Reverse degree based indices of some nanotubes ⋮ On new reversed topological invariants of nanotubes ⋮ Some reversed degree-based topological indices for graphene ⋮ Distance and eccentricity based invariants of windmill graph ⋮ On the reflexive edge strength of the circulant graphs ⋮ Edge irregular reflexive labeling for the \(r\)-th power of the path ⋮ Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs ⋮ The reflexive edge strength of toroidal fullerene ⋮ On the edge irregular reflexive labeling of corona product of graphs with path ⋮ Vertex irregular reflexive labeling of disjoint union of gear and book graphs ⋮ Edge irregular reflexive labeling for disjoint union of generalized Petersen graph
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
- On irregular total labellings
- Irregularity strength of trees
- On edge irregular reflexive labellings for the generalized friendship graphs
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Total edge irregularity strength of accordion graphs
- On edge irregular total labeling of categorical product of two cycles
- On the irregularity strength of them ×n grid
- A Tight Bound on the Irregularity Strength of Graphs
- On a conjecture about edge irregular total labelings
This page was built for publication: Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs