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, 2015, Issue 8, Pages 20–22
DOI: https://doi.org/10.17223/2226308X/8/7
(Mi pdma212)
 

Theoretical Foundations of Applied Discrete Mathematics

On degree structure of graphs

V. M. Fomichevab

a Financial University under the Government of the Russian Federation, Moscow
b "Security Code", Moscow
References:
Abstract: The paper presents some properties of degree structure for different classes of digraphs and describes degree structure for primitive digraphs with $n$ vertices and $n+1$ and $n+2$ arcs. For any integer $n\ge5$ and $k\in\{2,\dots,n-3\}$, the existence of a minimal primitive digraph with $n$ vertices, $n+k$ arcs and degree structure $\{(1,1)^{n-1},(k+1,k+1)^1\}$ is shown.
Keywords: minimal primitive graph, graph degree structure.
Document Type: Article
UDC: 519.6
Language: Russian
Citation: V. M. Fomichev, “On degree structure of graphs”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 20–22
Citation in format AMSBIB
\Bibitem{Fom15}
\by V.~M.~Fomichev
\paper On degree structure of graphs
\jour Prikl. Diskr. Mat. Suppl.
\yr 2015
\issue 8
\pages 20--22
\mathnet{http://mi.mathnet.ru/pdma212}
\crossref{https://doi.org/10.17223/2226308X/8/7}
Linking options:
  • https://www.mathnet.ru/eng/pdma212
  • https://www.mathnet.ru/eng/pdma/y2015/i8/p20
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:172
    Full-text PDF :50
    References:37
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024