On vertex types of graphs

DOI10.1007/S00373-018-1919-3MaRDI QIDQ1756037zbMATH OpenOpenAlexFDO

Authors Pu Qiao, Xingzhi Zhan

Publication date 11 January 2019

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.09540

zbMATH Keywords

degreesmallest ordervertex type

Mathematics Subject Classification ID

Vertex degrees (05C07)

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 in this paper.

Recommendations

• Classifying graphs by degrees
• scientific article; zbMATH DE number 6277690
• Almost every graph is vertex-oblique
• Vertex-oblique graphs
• Some properties of vertex-oblique graphs

Cites work

• Analyzing graphs by degrees
• On strong (weak) independent sets and vertex coverings of a graph
• Strong weak domination and domination balance in a graph

Cited in

(4)

• Classifying graphs by degrees
• scientific article; zbMATH DE number 6277690 (Why is no real title available?)
• Almost every graph is vertex-oblique
• Vertex-oblique graphs

This page was built for publication: On vertex types of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756037)