Abstract
The vertices of a graph are classified into seven types by J.T. Hedetniemi, S.M. Hedetniemi, S.T. Hedetniemi and T.M. Lewis and they ask the following questions: (1) What is the smallest order n of a graph having \(n-2\) very typical vertices or \(n-2\) typical vertices? (2) What is the smallest order of a pantypical graph? We answer these two questions and determine all the possible orders of the graphs in these three classes in this paper.






Similar content being viewed by others
References
Hedetniemi, J.T., Hedetniemi, S.M., Hedetniemi, S.T., Lewis, T.M.: Analyzing graphs by degrees. AKCE Int. J. Graphs Comb. 10(4), 359–375 (2013)
Kamath, S.S., Bhat, R.S.: On strong (weak) independent sets and vertex coverings of a graph. Discrete Math. 307(9–10), 1136–1145 (2007)
Sampathkumar, E., Latha, L.P.: Strong weak domination and domination balance in a graph. Discrete Math. 161(1–3), 235–242 (1996)
Acknowledgements
Professor Wendy Myrvold wrote a computer program, which found all smallest pantypical graphs.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the Shanghai SF grant 15ZR1411500, Science and Technology Commission of Shanghai Municipality (STCSM) Grant 13dz2260400 and the NSFC Grant 11671148.
Rights and permissions
About this article
Cite this article
Qiao, P., Zhan, X. On Vertex Types of Graphs. Graphs and Combinatorics 34, 889–900 (2018). https://doi.org/10.1007/s00373-018-1919-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-018-1919-3