524 search results - page 31 / 105 » On the Maximum Number of Cliques in a Graph |
162
click to vote
JCO
2007
15 years 6 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
163
click to vote
DM
2008
15 years 6 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
153
click to vote
ORL
2007
15 years 6 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
157
click to vote
COCOON
2007
Springer
16 years 27 days ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...