Palindromic characteristic of committed graphs and some model theoretic properties (Q5859628)
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: Palindromic characteristic of committed graphs and some model theoretic properties |
scientific article; zbMATH DE number 7334807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Palindromic characteristic of committed graphs and some model theoretic properties |
scientific article; zbMATH DE number 7334807 |
Statements
Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties (English)
0 references
19 April 2021
0 references
first-order logic
0 references
model theory of graphs
0 references
1-regular graphs
0 references
committed graphs
0 references
perfect matching
0 references
palindromes
0 references
infinite strings
0 references
formal languages
0 references
adjacency matrix
0 references
0.6705887317657471
0 references
0.6498189568519592
0 references
0.6448268890380859
0 references
0.6419164538383484
0 references
