Abstract
This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of minimally connected subgraphs. Also a notion of total proper connection is introduced and a question is asked about a possible relationship between the total proper connection number and the vertex and edge proper connection numbers.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call