Optimal identification of sets of edges using 2-factors

DOI10.1016/J.DISC.2013.04.015MaRDI QIDQ389983zbMATH OpenOpenAlexFDO

Authors Ville Junnila, Tero Laihonen

Publication date 22 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2013.04.015

zbMATH Keywords

identifying codeedge identificationfactor of a graphsets of edges

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Nearly optimal edge estimation with independent set queries
• An optimal lower bound on the number of variables for graph identification
• A probabilistic upper bound for the edge identification complexity of graphs
• Adaptive identification of sets of vertices in graphs
• scientific article; zbMATH DE number 49213
• Optimizing regular edge labelings
• Uniquely identifying the edges of a graph: the edge metric dimension
• Edge Estimation with Independent Set Oracles
• Edge estimation with independent set oracles
• Distance-based vertex identification in graphs: the outer multiset dimension

Cites work

• scientific article; zbMATH DE number 2081125 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• Constructing codes identifying sets of vertices
• Construction of codes identifying sets of vertices
• Extremal graphs without three‐cycles or four‐cycles
• Graph factors and factorization: 1985--2003: a survey
• Identifying codes in line graphs
• Minimum sizes of identifying codes in graphs differing by one vertex
• On Hamiltonian Regular Graphs of Girth Six
• On cages admitting identifying codes
• On codes identifying sets of vertices in Hamming spaces
• Sequences of optimal identifying codes

Cited in

(2)

• Identifying codes in line digraphs
• Location-domination in line graphs

This page was built for publication: Optimal identification of sets of edges using 2-factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389983)