721 search results - page 45 / 145 » Bounds on the k-domination number of a graph |
171
click to vote
JGAA
2008
15 years 6 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
157
click to vote
DAM
2010
15 years 6 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
183
click to vote
NETWORKS
2008
15 years 6 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
146
click to vote
JGT
2008
15 years 6 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
138
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...