A tight bound for independent domination of cubic graphs without 4-cycles.
Eun-Kyung ChoIlkyoo ChoiHyemin KwonBoram ParkPublished in: J. Graph Theory (2023)
Keyphrases
- upper bound
- lower bound
- worst case
- directed graph
- generalization error bounds
- graph matching
- b spline
- database
- pattern recognition
- structured objects
- graph theoretic
- undirected graph
- graph representation
- machine learning
- pairwise
- series parallel
- small world
- vc dimension
- graph theory
- error bounds
- random walk
- optimal solution
- semi supervised