On Cartesian products of signed graphs

DOI10.1007/978-3-030-39219-2_19zbMath1456.05133arXiv2010.10066OpenAlexW3000938722MaRDI QIDQ5896107

Dimitri Lajou

Publication date: 21 July 2020

Published in: Discrete Applied Mathematics, Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.10066

zbMATH Keywords

chromatic numberCartesian productssigned graphsprime factor decompositionprime factor decomposition of signed graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On products and line graphs of signed graphs, their eigenvalues and energy
• Factoring a graph in polynomial time
• Graph multiplication
• Recognizing Cartesian products in linear time
• Containment properties of product and power graphs
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Signed graphs
• Cartesian graph factorization at logarithmic cost per edge
• Cartesian products of directed graphs with loops
• Cancellation properties of products of graphs
• On the notion of balance of a signed graph
• Graphs with Given Group and Given Graph-Theoretical Properties
• Product graph representations
• Homomorphisms of Signed Graphs

This page was built for publication: On Cartesian products of signed graphs