"On Ve-Degrees and Ev-Degrees in Graphs" by Mustapha Chellali, Teresa W. Haynes et al.
 

On Ve-Degrees and Ev-Degrees in Graphs

Document Type

Article

Publication Date

2-6-2017

Description

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

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 78
  • Usage
    • Abstract Views: 9
  • Captures
    • Readers: 17
see details

Share

COinS