Graphs with prescribed local neighborhoods of their universal coverings
Journal of Combinatorial Theory, Series B（2019）
Abstract
Given a collection of n rooted trees with depth h, we give a necessary and sufficient condition for this collection to be the collection of h-depth universal covering neighborhoods at each vertex.
MoreTranslated text
Key words
Degree sequence,Erdös–Gallai theorem,Universal covering
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined