On -degrees and -degrees in graphs

详细信息    查看全文

• 作者：Mustapha Chellali^a ; ^{m_chellali@yahoo.com} ; Teresa W. Haynes^b ; ^c ; ^{haynes@etsu.edu} ; Stephen T. Hedetniemi^d ; ^{hedet@clemson.edu} ; Thomas M. Lewis^e ; ^{tom.lewis@furman.edu}
• 关键词：Vertex ; Degree ; Regular graph ; Irregular graph ; Vertex&ndash ; edge domination ; Edge&ndash ; vertex domination ; Vertex&ndash ; edge degree ; Edge&ndash ; vertex degree
• 刊名：Discrete Mathematics
• 出版年：2017
• 出版时间：6 February 2017
• 年：2017
• 卷：340
• 期：2
• 页码：31-38
• 全文大小：441 K
• 卷排序：340

文摘

Let G=(V,E)G=(V,E) be a graph with vertex set VV and edge set EE. A vertex v∈Vv∈Vveve-dominates every edge incident to it as well as every edge adjacent to these incident edges. The vertex–edge degree of a vertex vv is the number of edges veve-dominated by vv. Similarly, an edge e=uve=uv evev-dominates the two vertices uu and vv incident to it, as well as every vertex adjacent to uu or vv. The edge–vertex degree of an edge ee is the number of vertices evev-dominated by edge ee. In this paper we introduce these types of degrees and study their properties.