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.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-11950 |
| Date | 06 February 2017 |
| Creators | Chellali, Mustapha, Haynes, Teresa W., Hedetniemi, Stephen T., Lewis, Thomas M. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0019 seconds