6 citations · 31 across the 37 of their papers we have counts for
6 papers · 2 filters
Roman Bondage Numbers of Some Graphs
Fu-Tao Hu, Ju-Ming Xu
A Roman dominating function on a graph is a function satisfying the condition that every vertex with is adjacent to at least one vertex $…
The bondage number of -regular graphs of order
Fu-Tao Hu, Jun-Ming Xu
Let be a graph. A subset is a dominating set if every vertex not in is adjacent to a vertex in . The domination number of is the smallest cardin…
The total bondage number of grid graphs
Fu-Tao Hu, You Lu, Jun-Ming Xu
The total domination number of a graph without isolated vertices is the minimum number of vertices that dominate all vertices in . The total bondage number of i…
Total and paired domination numbers of toroidal meshes
Fu-Tao Hu, Jun-Ming Xu
Let be a graph without isolated vertices. The total domination number of is the minimum number of vertices that can dominate all vertices in , and the paired domination…
The Bondage Number of Mesh Networks
Fu-Tao Hu, Yong-Chang Cao, Jun-Ming Xu
The bondage number of a nonempty graph is the smallest number of edges whose removal from results in a graph with domination number greater than that of . Denote…
Complexity of Bondage and Reinforcement
Fu-Tao Hu, Jun-Ming Xu
Let be a graph. A subset is a dominating set if every vertex not in is adjacent to a vertex in . A dominating set is called a total dominating s…