Edge-colored graphs with applications to homogeneous faults

DOI10.1016/j.ipl.2011.03.017zbMath1260.68306arXiv1207.5439MaRDI QIDQ1944099

Yongge Wang, Yvo G. Desmedt

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

graphs; fault tolerance; network security; network reliability; homogeneous faults

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

On encoding symbol degrees of array BP-XOR codes, Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics, Refined parameterizations for computing colored cuts in edge-colored graphs, Colored cut games, Adaptive synchronization and pinning control of colored networks, Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized cover-free families.
• Colorful isomorphic spanning trees in complete graphs
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Computing and Combinatorics
• Algorithms and Computation
• Secure communication in multicast channels: The answer to Franklin and Wright's question