Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Minyard, Mitchell"'
Autor:
Minyard, Mitchell, Sepanski, Mark R.
A graph is said to be neighborhood 3-balanced if there exists a vertex labeling with three colors so that each vertex has an equal number of neighbors of each color. We give order constraints on 3-balanced graphs, determine which generalized Petersen
Externí odkaz:
http://arxiv.org/abs/2410.05422
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Minyard, Mitchell, Rosengartner, Kyle
Given a finite simple graph $G$, let $\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \operatorname{
Externí odkaz:
http://arxiv.org/abs/2409.02306