About a construction method of indistinguishability relations for vertex labeled graphs (Q2901629)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: About a construction method of indistinguishability relations for vertex labeled graphs |
scientific article; zbMATH DE number 6062170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | About a construction method of indistinguishability relations for vertex labeled graphs |
scientific article; zbMATH DE number 6062170 |
Statements
31 July 2012
0 references
labeled graphs
0 references
pair graph
0 references
distinguishability relation
0 references
weak distinguishability relation
0 references
About a construction method of indistinguishability relations for vertex labeled graphs (English)
0 references
The problem of distinguishing vertex labeled graphs and their vertices is considered. The author associates with the vertices languages over the alphabet of labels and distinguishes the graphs and their vertices by comparing these languages. The method of pair graphs is developed for the analysis of the vertex languages. This method is the modification of the pair states method of automata theory.
0 references
0.8090922832489014
0 references
0.7678550481796265
0 references
0.7600854635238647
0 references
0.7516403794288635
0 references
