Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
By J. Przybyło. 2008
50 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/05b6933dbe7df8cb88daa934eb06ad2df4bba33c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Discrete Mathematics and Combinatorics
Citations in the corpus
- A Dynamic Survey of Graph Labeling (2009, background): “For d-regular (d > 0) graphs, Przybylo [1454] gave bounds for tvs(G) in terms d and the order of G.”