- 期刊
- OpenAccess
Edge Dominating Graph of a Graph
並列摘要
The edge dominating graph ED(G) of a graph G = (V,E) is a graph with V (ED(G))=E(G)∪ S(G), where S(G) is the set of all minimal edge dominating sets of G with two vertices u, v ∈ V (ED(G)) adjacent if u ∈ E and v is a minimal edge dominating set of G containing u. In this paper, we establish the bounds on order and size, diameter and vertex(edge) connectivity.
並列關鍵字
無資料延伸閱讀
- Ye, Y. S., Liu, F., & Shi, C. X. (2014). The 2-Pebbling Property of the Middle Graph of Fan Graphs. Journal of Applied Mathematics, 2014(), 366-370-240. https://doi.org/10.1155/2014/304514
- Liu, C. H. (2009). Roman domination on graphs [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2009.00516
- XIKUI, L., & YAN, L. (2005). THE INCIDENCE CHROMATIC NUMBER OF SOME GRAPH. International Journal of Mathematics and Mathematical Sciences, 2005(), 803-813-059. https://doi.org/10.1155/IJMMS.2005.803
- Huang, L. H. (2009). On the Rank of Graphs [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2009.01977
- Chelvam, T. T., & Chellathurai, S. R. (2009). Complementary Nil Domination Number of a Graph. Tamkang Journal of Mathematics, 40(2), 165-172. https://www.airitilibrary.com/Article/Detail?DocID=00492930-200906-200911130022-200911130022-165-172