The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree.

Published in: Comb. (2022)

Keyphrases

random graphs
graph matching
spanning tree
minimum cost
directed graph
connected dominating set
low degree
series parallel
graph theoretic
machine learning
np complete
pattern recognition
case study
graph clustering
information retrieval
neural network
databases