Name
Abstract | ||
|---|---|---|
Abstract Let G = ( V , E ) be a graph with vertex set V and edge set E . A vertex v ∈ V v e -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 v e -dominated by v . Similarly, an edge e = u v e v -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 e v -dominated by edge e . In this paper we introduce these types of degrees and study their properties. |
Year | Venue | Field |
|---|---|---|
2017 | Discrete Mathematics | Discrete mathematics,Combinatorics,Bound graph,Vertex (geometry),Edge cover,Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Degree (graph theory),Mathematics,Saturation (graph theory) |
DocType | Volume | Issue |
Journal | 340 | 2 |
Citations | PageRank | References |
1 | 0.37 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mustapha Chellali | 1 | 188 | 38.24 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Stephen T. Hedetniemi | 3 | 1575 | 289.01 |
| Thomas M. Lewis | 4 | 3 | 1.70 |