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


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




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

Diskretnaya Matematika, 2007, Volume 19, Issue 1, Pages 89–94
DOI: https://doi.org/10.4213/dm11 (Mi dm11) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Mark sequences in multigraphs

Sh. Pirzada
Full-text PDF (88 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm11
Abstract: An $r$-digraph is an orientation of a multigraph which has no loops and contains at most $r$ edges between any pair of distinct vertices. We give a simple proof of necessary and sufficient conditions for a sequence of non-negative integers arranged in nondecreasing order to be a sequence of numbers, called marks or $r$-scores, attached to the vertices of an $r$-digraph.
Received: 08.06.2005
Revised: 01.12.2006
English version:
Discrete Mathematics and Applications, 2007, Volume 17, Issue 1, Pages 71–76
DOI: https://doi.org/10.1515/DMA.2007.008
Bibliographic databases:
UDC: 519.1
Language: Russian
Citation: Sh. Pirzada, “Mark sequences in multigraphs”, Diskr. Mat., 19:1 (2007), 89–94; Discrete Math. Appl., 17:1 (2007), 71–76
Citation in format AMSBIB
\Bibitem{Pir07}
\by Sh.~Pirzada
\paper Mark sequences in multigraphs
\jour Diskr. Mat.
\yr 2007
\vol 19
\issue 1
\pages 89--94
\mathnet{http://mi.mathnet.ru/dm11}
\crossref{https://doi.org/10.4213/dm11}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2325907}
\zmath{https://zbmath.org/?q=an:05233529}
\elib{https://elibrary.ru/item.asp?id=9468390}
\transl
\jour Discrete Math. Appl.
\yr 2007
\vol 17
\issue 1
\pages 71--76
\crossref{https://doi.org/10.1515/DMA.2007.008}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34248143863}
Linking options:
  • https://www.mathnet.ru/eng/dm11
  • https://doi.org/10.4213/dm11
  • https://www.mathnet.ru/eng/dm/v19/i1/p89
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024