Name
Abstract | ||
|---|---|---|
We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number of edges of the given graph. |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS MATHEMATICA CONTEMPORANEA | Graphs,monoids,factorizations,algorithms |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Indifference graph,Modular decomposition,Cartesian product of graphs,Chordal graph,Graph product,Cograph,Pathwidth,1-planar graph,Mathematics | Journal | 11 |
Issue | ISSN | Citations |
1 | 1855-3966 | 2 |
PageRank | References | Authors |
0.43 | 1 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| tetiana boiko | 1 | 2 | 0.43 |
| johannes cuno | 2 | 6 | 1.02 |
| Wilfried Imrich | 3 | 444 | 53.81 |
| Florian Lehner | 4 | 21 | 7.24 |
| Christiaan Van De Woestijne | 5 | 13 | 2.33 |