Open AccessElementary classes of graphs in a language without equality predicate
Author(s) -
В. Н. Ремесленников,
Alexander Treier
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1546/1/012099
Subject(s) - predicate (mathematical logic) , mathematics , equivalence (formal languages) , discrete mathematics , computer science , combinatorics , programming language
In this paper we describe equivalence classes generated by finite graphs in the graph theory language without equality predicate. These classes coincide with classes of so called hard extensions of graphs.