Publication:2409504

DOI10.1007/s00373-017-1800-9zbMath1371.05224arXiv1512.06966OpenAlexW2963729851MaRDI QIDQ2409504

Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan

Publication date: 11 October 2017

Published in: Graphs and Combinatorics, Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

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

zbMATH Keywords

combinatoricsapproximation algorithmCayley graphsgroup actionorthogonal arrayssoftware testingCartesian product of graphscovering arrayscovering arrays on graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatorial aspects of packing and covering (05B40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Mixed covering arrays on graphs of small treewidth ⋮ A hyperedge coloring and application in combinatorial testing ⋮ Improved strength four covering arrays with three symbols ⋮ Improved covering arrays using covering perfect hash families with groups of restricted entries ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local prime factor decomposition algorithm
• Graph multiplication
• Covering arrays of strength three
• Problems and algorithms for covering arrays
• Families of \(k\)-independent sets
• Covering arrays on graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• On Cartesian skeletons of graphs
• Vector sets for exhaustive testing of logic circuits
• Covering arrays with mixed alphabet sizes
• Group construction of covering arrays
• Covering arrays and intersecting codes
• Compressing inconsistent data
• Mixed covering arrays on graphs
• Products of mixed covering arrays of strength two
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity
• Prime numbers and computer methods for factorization

This page was built for publication: Covering arrays on product graphs