Buscar
Mostrando ítems 11-20 de 168
Edge-coloring Of Split Graphs
(CHARLES BABBAGE RES CTRWINNIPEG, 2015)
Partitioning chordal graphs into independent sets and cliques
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
On weighted clique graphs
(2011)
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
(Elsevier Science, 2010-08)
The notion of k-limited packing in a graph is a generalization of 2-packing. For a given non negative integer k, a subset B of vertices is a k-limited packing if there are at most k elements of B in the closed neighborhood ...
Characterization of classical graph classes by weighted clique graphs
(Elsevier Science, 2014-03)
Given integers m1,…,mℓ, the weighted clique graph of G is the clique graph K(G), in which there is a weight assigned to each complete set S of size mi of K(G), for each i=1,…,ℓ. This weight equals the cardinality of the ...
Total dominating sequences in trees, split graphs, and under modular decomposition
(Elsevier Science, 2018-05)
A sequence of vertices in a graph G with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices ...