Results 111 to 120 of about 262 (120)
Some of the next articles are maybe not open access.
Weak-trees with equal distance-2 domination and independent domination
, 2021The distance between two vertices u and v in a graph equals the length of a shortest path from u to v. The distance-2 domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a vertex subset where every vertex not belonging to the ...
Guorong Gao, Min-Jen Jou, Jenq-Jong Lin
semanticscholar +1 more source
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
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
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
Multiple Amalgamated Free Products and Multiple Free Products with Commuting Subgroups by Trees
International Journal of Applied MathematicsWe define multiple amalgamated free product of groupsand multiple free product of groups with commuting subgroups and we prove that when a group G acts on a tree Γ such that the quotient graph G/Γ is pathn−1, G maybe identified with the free product of n
S. Douboula
semanticscholar +1 more source
Design and Analysis of Infectious Disease Studies
Oberwolfach Reports, 2019This was the fifth workshop on mathematical and statistical methods on the transmission of infectious diseases. Building on epidemiologic models which were the subject of earlier workshops, this workshop concentrated on disentangling who infected whom by
M. Eichner, M. E. Halloran, P. O’Neill
semanticscholar +1 more source
Intersections among P^{(3)}(1,5)-designs
, 2016M. Gionfriddo, Salvatore Milici
semanticscholar +1 more source