Loading [MathJax]/jax/output/CommonHTML/jax.js
Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Prikladnaya Diskretnaya Matematika, 2011, Number 4(14), Pages 34–41 (Mi pdm341)  

Applied Graph Theory

On minimal vertex 1-extensions of special type graph union

M. B. Abrosimov

Saratov State University named after N. G. Chernyshevsky, Saratov, Russia
References:
Abstract: In 2001, it was conjectured that the minimal vertex 1-extension of a graph G+G, where G is a minimal vertex 1-extension of graph G, is unique up to isomorphism and has the form G+G. We construct two counterexamples to this conjecture showing that, in general, it is wrong. Also, we show that the statement is true for many graphs.
Keywords: graph, minimal vertex extension, exact vertex extension, fault tolerance.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: M. B. Abrosimov, “On minimal vertex 1-extensions of special type graph union”, Prikl. Diskr. Mat., 2011, no. 4(14), 34–41
Citation in format AMSBIB
\Bibitem{Abr11}
\by M.~B.~Abrosimov
\paper On minimal vertex 1-extensions of special type graph union
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 4(14)
\pages 34--41
\mathnet{http://mi.mathnet.ru/pdm341}
Linking options:
  • https://www.mathnet.ru/eng/pdm341
  • https://www.mathnet.ru/eng/pdm/y2011/i4/p34
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:205
    Full-text PDF :146
    References:50
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025