524 search results - page 17 / 105 » On the Maximum Number of Cliques in a Graph |
EPIA
2009
Springer
14 years 2 months ago
2009
Springer
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...
JGT
2006
13 years 7 months ago
2006
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...
DM
2008
13 years 7 months ago
2008
GC
2011
Springer
13 years 2 months ago
2011
Springer
JGT
2007
13 years 7 months ago
2007