Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 5, Pages 19–25 (Mi da583)  
On the entropy minimal hereditary classes of coloured graphs

V. E. Alekseev, S. V. Sorochan

Nizhny Novgorod State University, Nizhny Novgorod, Russia
Full-text PDF (233 kB)
References:
PDF
HTML
Abstract: We consider hereditary classes of graphs with coloured edges. The class is called entropy minimal if it does not contain proper hereditary subclasses having the same entropy value (logarithmic density). It is known for simple graphs that, for arbitrary fixed $a$ and $b$, the class consisting of all graphs admitting a partition by $a$ cliques and $b$ independent sets is entropy minimal. We prove a generalization of this statement for coloured graphs. Bibl. 5.
Keywords: hereditary class, entropy, entropy minimal class.
Received: 16.04.2008
Revised: 08.05.2009
English version:
Journal of Applied and Industrial Mathematics, 2010, Volume 4, Issue 2, Pages 143–146
DOI: https://doi.org/10.1134/S1990478910020018
Bibliographic databases:
UDC: 519.17
Language: Russian
Citation: V. E. Alekseev, S. V. Sorochan, “On the entropy minimal hereditary classes of coloured graphs”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 19–25; J. Appl. Industr. Math., 4:2 (2010), 143–146
Citation in format AMSBIB
\Bibitem{AleSor09}
\by V.~E.~Alekseev, S.~V.~Sorochan
\paper On the entropy minimal hereditary classes of coloured graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 5
\pages 19--25
\mathnet{http://mi.mathnet.ru/da583}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2590751}
\zmath{https://zbmath.org/?q=an:1249.05104}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 2
\pages 143--146
\crossref{https://doi.org/10.1134/S1990478910020018}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77953486145}
Linking options:
  • https://www.mathnet.ru/eng/da583
  • https://www.mathnet.ru/eng/da/v16/i5/p19
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:289
    Full-text PDF :87
    References:59
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024