402 search results - page 20 / 81 » On Finding the Number of Graph Automorphisms |
113
Voted
MP
2006
14 years 11 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
JGT
2006
14 years 11 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
SIROCCO
2008
15 years 1 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
JCT
2006
14 years 11 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...