The F-domination Problems on Graphs
博士 === 國立東華大學 === 應用數學系 === 99 === Given a graph G and a set S⊆V(G), a vertex v is said to be F-dominated by a vertex w in S if either v=w, or v∉S and there exists a vertex u in V(G)-S such that P:wuv is a path in G. A set S⊆V(G) is an F-dominating set of G if every vertex v is F-dominated by a vert...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/11149351031061996851 |