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, 2019, Number 45, Pages 78–84
DOI: https://doi.org/10.17223/20710410/45/8 (Mi pdm673) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Applied Graph Theory

On the one edge algorithm for the orthogonal double covers

R. El-Shanawany, A. El-Mesady

Menoufia University, Menouf, Egypt
Full-text PDF (615 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17223/20710410/45/8
Abstract: The existing problem of the orthogonal double covers of the graphs is well-known in the theory of combinatorial designs. In this paper, a new technique called the one edge algorithm for constructing the orthogonal double covers of the complete bipartite graphs by copies of a graph is introduced. The advantage of this algorithm is that it is accessible to discrete mathematicians not intimately familiar with the theory of the orthogonal double covers.
Keywords: graph decomposition, symmetric starter, orthogonal double covers.
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: English
Citation: R. El-Shanawany, A. El-Mesady, “On the one edge algorithm for the orthogonal double covers”, Prikl. Diskr. Mat., 2019, no. 45, 78–84
Citation in format AMSBIB
\Bibitem{El-El-19}
\by R.~El-Shanawany, A.~El-Mesady
\paper On the one edge algorithm for the orthogonal double covers
\jour Prikl. Diskr. Mat.
\yr 2019
\issue 45
\pages 78--84
\mathnet{http://mi.mathnet.ru/pdm673}
\crossref{https://doi.org/10.17223/20710410/45/8}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000493376200009}
Linking options:
  • https://www.mathnet.ru/eng/pdm673
  • https://www.mathnet.ru/eng/pdm/y2019/i3/p78
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:158
    Full-text PDF :66
    References:24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024