Name
Abstract | ||
|---|---|---|
Many large graphs can be constructed from existing smaller graphs by using graph operations, for example, the Cartesian product and the lexicographic product. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this short note, we give some properties of the lexicographic products of vertex-transitive and of edge-transitive graphs. In particular, we show that the lexicographic product of Cayley graphs is a Cayley graph. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.aml.2011.05.021 | Applied Mathematics Letters |
Keywords | Field | DocType |
Cayley graph,Lexicographic product,Vertex-transitive graph | Discrete mathematics,Indifference graph,Combinatorics,Modular decomposition,Vertex-transitive graph,Lexicographic breadth-first search,Chordal graph,Graph product,Cograph,Pathwidth,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 11 | 0893-9659 |
Citations | PageRank | References |
3 | 0.41 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Li | 1 | 20 | 4.90 |
| Wei Wang | 2 | 81 | 12.64 |
| Zongben Xu | 3 | 3203 | 198.88 |
| Haixing Zhao | 4 | 18 | 13.27 |