The following pages link to On graph irregularity strength (Q4798109):
Displaying 28 items.
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- Computing the edge irregularity strengths of chain graphs and the join of two graphs (Q5009980) (← links)
- Total vertex irregularity strength of generalized prism graphs (Q5043945) (← links)
- Product irregularity strength of graphs with small clique cover number (Q5045247) (← links)
- On the total irregularity strength of convex polytope graphs (Q5063438) (← links)
- Edge irregularity strength of certain families of comb graph (Q5145921) (← links)
- Vertex irregular reflexive labeling of prisms and wheels (Q5154558) (← links)
- On irregularity strength of disjoint union of friendship graphs (Q5177025) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- Total Vertex Irregularity Strength of Dense Graphs (Q5418767) (← links)
- On the edge irregularity strength of corona product of graphs with cycle (Q5859493) (← links)
- Computing the Total Vertex Irregularity Strength Associated with Zero Divisor Graph of Commutative Ring (Q5881366) (← links)
- Irregular subgraphs (Q5885195) (← links)
- Irregularity strength of dense graphs (Q5902039) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs (Q6052468) (← links)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
- Modular irregularity strength on some flower graphs (Q6109767) (← links)
- On edge irregularity strength of different families of graphs (Q6118270) (← links)
- Further results on edge irregularity strength of some graphs (Q6563249) (← links)
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)
- Modular irregularity strength of dense graphs (Q6571568) (← links)
- Choosing friends in everyday life by using graph theory (Q6580144) (← links)
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs (Q6585249) (← links)
- Characterizing irregularity in planar graph structures (Q6586816) (← links)
- On edge irregularity strength of cycle-star graphs (Q6586864) (← links)
- Modular irregularity strength of the corona product of graphs (Q6633239) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)
