On upper bound of vertex distinguishing word length on vertex labeled graph

MaRDI QIDQ3453845zbMATH OpenFDO

Authors S. V. Sapunov

Publication date 30 November 2015

Full work available at URL http://mathnet.ru/eng/isu403

zbMATH Keywords

languages over the label alphabetvertex equivalencevertex labeled graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• About a construction method of indistinguishability relations for vertex labeled graphs
• scientific article; zbMATH DE number 2239801
• On the local distinguishing numbers of cycles
• On computing the distinguishing numbers of trees and forests
• Vertex-distinguishing proper edge-colorings

Cited in

(2)

• Domination on the vertices of labeled graphs
• About a construction method of indistinguishability relations for vertex labeled graphs

This page was built for publication: On upper bound of vertex distinguishing word length on vertex labeled graph

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