401 search results - page 19 / 81 » Sparse Quasi-Random Graphs |
158
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
178
click to vote
DM
2010
15 years 6 months ago
2010
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
