95 search results - page 14 / 19 » Hamiltonian-Laceability of Star Graphs |
100
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
WWW
2001
ACM
16 years 10 days ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
102
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
109
click to vote
CCCG
2009
15 years 24 days ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
109
click to vote
GC
2008
Springer
14 years 11 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...