About a construction method of indistinguishability relations for vertex labeled graphs

MaRDI QIDQ2901629zbMATH OpenFDO

Authors S. V. Sapunov

Publication date 31 July 2012

Published in Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki (Search for Journal in Brave)

zbMATH Keywords

labeled graphsdistinguishability relationpair graphweak distinguishability relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2239801
• On upper bound of vertex distinguishing word length on vertex labeled graph
• Characterization of languages that can be represented by vertex-labeled graphs
• Mathematical Foundations of Computer Science 2005
• Domination on the vertices of labeled graphs

Cited in

(5)

• Linguistic representation of vertex-labeled graphs
• scientific article; zbMATH DE number 2217772 (Why is no real title available?)
• On upper bound of vertex distinguishing word length on vertex labeled graph
• Domination on the vertices of labeled graphs
• Identification of vertices of vertex-labeled graphs

This page was built for publication: About a construction method of indistinguishability relations for vertex labeled graphs

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