Login / Signup
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment.
Jakub Przybylo
Published in:
Eur. J. Comb. (2024)
Keyphrases
</>
weight assignment
upper bound
graph theory
graph matching
rough sets
graph mining
graph theoretic
expert systems
directed graph
randomly generated
graph representation
series parallel
high quality
bipartite graph
social networks
weighted graph
graph databases
feature extraction