On graphs with a given endomorphism monoid
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206643" target="_blank" >RIV/00216208:11320/09:00206643 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On graphs with a given endomorphism monoid
Original language description
For special classes of finite monoids (e.g. groups, semilattices, normal bands) it is given an upper bound of size of graphs representing monoids from this class as an endomorphism monoid of graphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
62
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
—
UT code for WoS article
000271113000004
EID of the result in the Scopus database
—