Total vertex irregularity strength of generalized prism graphs
From MaRDI portal
Publication:5043945
DOI10.1080/09720529.2020.1848103zbMATH Open1496.05161OpenAlexW3124891301MaRDI QIDQ5043945FDOQ5043945
Authors: M. Imran, Ali Ahmad, Muhammad Kamran Siddiqui, Tariq Mehmood 
Publication date: 6 October 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2020.1848103
Recommendations
- Total vertex irregularity strength of some graphs
- On total vertex irregularity strength of graphs
- The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges
- Total vertex irregularity strength of convex polytope graphs
- Total irregularity strength of disjoint union of crossed prism and necklace graphs
- On the total irregularity strength of some graphs
- Total vertex irregularity strength of dense graphs
- On reflexive edge strength of generalized prism graphs
- A new upper bound for the total vertex irregularity strength of graphs
- On the total irregularity strength of convex polytope graphs
generalized prismirregularity strengthtotal vertex irregularity strengthvertex irregular total \(k\)-labeling
Cites Work
- A new upper bound for the total vertex irregularity strength of graphs
- On domination numbers of Cartesian products of paths
- Title not available (Why is that?)
- On graph irregularity strength
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- On irregular total labellings
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- Total edge irregularity strength of generalized prism
- Edge Addition Number of Cartesian Product of Paths and Cycles
- Global defensive alliances of trees and Cartesian product of paths and cycles
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- Title not available (Why is that?)
- Irregular labelings of circulant graphs
- On vertex irregular total labelings.
- Total vertex irregular labelings of wheels, fans, suns and frienship graphs
- Total vertex irregular labeling of complete bipartite graphs
- Product irregularity strength of graphs
- Vertex irregular total labeling of cubic graphs
- Super edge trimagic total labeling of generalized prism and web graphs
Cited In (1)
This page was built for publication: Total vertex irregularity strength of generalized prism graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043945)
