Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
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


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2012, Volume 3, Issue 3, Pages 105–128
DOI: https://doi.org/10.4213/mvk63 (Mi mvk63) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Graph reduction in the construction of minimal clique cover

P. V. Roldugin

Moscow State Technical University of Radio Engineering, Electronics and Automatics, Moscow
Full-text PDF (221 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk63
Abstract: The problem of construction of a graph coverage with a minimum number of its complete subgraphs (cliques) is considered. We describe classes of subgraphs for which it is possible to reduce the graph coverage problem to the same problem for graphs of smaller orders. We show that these classes are wider than those known before.
Key words: classes of graphs, graph coverings, cliques.
Received 20.V.2011
Document Type: Article
UDC: 519.177.3+519.178
Language: Russian
Citation: P. V. Roldugin, “Graph reduction in the construction of minimal clique cover”, Mat. Vopr. Kriptogr., 3:3 (2012), 105–128
Citation in format AMSBIB
\Bibitem{Rol12}
\by P.~V.~Roldugin
\paper Graph reduction in the construction of minimal clique cover
\jour Mat. Vopr. Kriptogr.
\yr 2012
\vol 3
\issue 3
\pages 105--128
\mathnet{http://mi.mathnet.ru/mvk63}
\crossref{https://doi.org/10.4213/mvk63}
Linking options:
  • https://www.mathnet.ru/eng/mvk63
  • https://doi.org/10.4213/mvk63
  • https://www.mathnet.ru/eng/mvk/v3/i3/p105
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:604
    Full-text PDF :313
    References:54
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024