Problemy Upravleniya
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


Probl. Upr.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Upravleniya, 2010, Issue 1, Pages 2–6 (Mi pu1)  
Mathematical problems of control theory

On the problem of enumeration of generating graphs with specified diameter

D. L. Belotserkovskii

Gubkin Russian State University of Oil and Gas
Full-text PDF (659 kB)
References:
PDF
HTML
Abstract: The paper proves the theorem of enumeration of graphs in which after removing an arbitrary vertex or edge the diameter of the graph obtained does not exceed three.
Keywords: graph, degree of vertex, adjacency, Handshake's lemma, diameter, minimal number of edges, operation of duplication.
Document Type: Article
UDC: 519.176
Language: Russian
Citation: D. L. Belotserkovskii, “On the problem of enumeration of generating graphs with specified diameter”, Probl. Upr., 2010, no. 1, 2–6
Citation in format AMSBIB
\Bibitem{Bel10}
\by D.~L.~Belotserkovskii
\paper On the problem of enumeration of generating graphs with specified diameter
\jour Probl. Upr.
\yr 2010
\issue 1
\pages 2--6
\mathnet{http://mi.mathnet.ru/pu1}
Linking options:
  • https://www.mathnet.ru/eng/pu1
  • https://www.mathnet.ru/eng/pu/v1/p2
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы управления
    Statistics & downloads:
    Abstract page:168
    Full-text PDF :70
    References:36
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024