Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 73–75 (Mi pdma72)  
Applied graph theory

On the upper bound for the number of additional edges in minimal vertex extensions of colored circles

P. P. Bondarenko

Saratov State University
Full-text PDF (558 kB)
References:
PDF
HTML
Abstract: An upper bound for the number of additional edges in the minimum vertex 1-extensions of cycles with the vertices of two types and a general construction of one of such extensions are given.
Keywords: graph, circle, minimal extension, fault-tolerance.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: P. P. Bondarenko, “On the upper bound for the number of additional edges in minimal vertex extensions of colored circles”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 73–75
Citation in format AMSBIB
\Bibitem{Bon13}
\by P.~P.~Bondarenko
\paper On the upper bound for the number of additional edges in minimal vertex extensions of colored circles
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 73--75
\mathnet{http://mi.mathnet.ru/pdma72}
Linking options:
  • https://www.mathnet.ru/eng/pdma72
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p73
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025