Sciweavers

524 search results - page 17 / 105
» On the Maximum Number of Cliques in a Graph
Sort
View
EPIA
2009
Springer
15 years 6 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
JGT
2006
48views more  JGT 2006»
14 years 11 months ago
Maximum pebbling number of graphs of diameter three
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
Boris Bukh
DM
2008
53views more  DM 2008»
14 years 11 months ago
Distance graphs with maximum chromatic number
Javier Barajas, Oriol Serra