The Kronecker product and local computations in graphs
From MaRDI portal
Publication:5878897
DOI10.1007/3-540-61064-2_25OpenAlexW1571294250MaRDI QIDQ5878897
Publication date: 23 February 2023
Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61064-2_25
Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Easy impossibility proofs for distributed consensus problems
- Finite common coverings of pairs of regular graphs
- Computing with graph rewriting systems with priorities
- Coverings and minors: Application to local computations in graphs
- On the recognition of families of graphs with local computations
- The Kronecker Product of Graphs
- Double covers of graphs
- Kronecker Products and Local Joins of Graphs
- Different local controls for graph relabeling systems
- The Categorical Product of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Kronecker product and local computations in graphs