Results 91 to 100 of about 1,497 (106)
Some of the next articles are maybe not open access.
On the 2-independence number of trees
, 2020The distance between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is a 2independent set if the distance between any two elements in S is greater than two in G.
Min-Jen Jou, Jenq-Jong Lin, Qian-Yu Lin
semanticscholar +1 more source
Trees with the same distance domination number
, 2020The distance between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set D of vertices is distance-k dominating if every vertex not belonging to D is at distance at most k of a vertex in D.
Min-Jen Jou, Jenq-Jong Lin, Qian-Yu Lin
semanticscholar +1 more source
On the 2-independence number of connected graphs
, 2020The distance between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is a 2independent set if the distance between any two elements in S is greater than two in G.
Min-Jen Jou, Jenq-Jong Lin, Qian-Yu Lin
semanticscholar +1 more source
The 3-independence number of trees
, 2020The 3-independence number of a graph G, denoted by α3(G), is the maximum size of a set of vertices at pairwise distance greater than three. Here we focus on the trees.
Jenq-Jong Lin, Min-Jen Jou, Qian-Yu Lin
semanticscholar +1 more source
Secure convex domination in a graph
, 2015Enrico L. Enriquez, S. Canoy
semanticscholar +1 more source
Restrained convex dominating sets in the corona and the products of graphs
, 2015Enrico L. Enriquez, S. Canoy
semanticscholar +1 more source
1-Movable independent domination in graphs
, 2015Renario G. Hinampas, S. Canoy
semanticscholar +1 more source
Isolate domination in the join and corona of graphs
, 2015Benjier H. Arriola
semanticscholar +1 more source
Secure domination in the joins of graphs
, 2014Elmer Castillano +2 more
semanticscholar +1 more source