|
Edge clique covering sum of graphs
|
# |
|
|
Pairwise balanced designs and sigma clique partitions
|
# |
|
|
Local Clique Covering of Claw-Free Graphs
|
# |
|
|
Clustering and outlier detection using isoperimetric number of trees
|
# |
|
|
On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
|
# |
|
|
On b-coloring of cartesian product of graphs
|
# |
|
|
On the complexity of isoperimetric problems on trees
|
# |
|
|
On the isoperimetric spectrum of graphs and its approximations
|
# |
|