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, 2012, Number 2(16), Pages 90–94 (Mi pdm365)  
This article is cited in 2 scientific papers (total in 2 papers)

Applied Graph Theory

The system of abstract connected subgraphs of a linear graph

V. N. Salii

Saratov State University named after N. G. Chernyshevsky, Saratov, Russia
Full-text PDF (584 kB) Citations (2)
References:
PDF
HTML
Abstract: A linear graph is a graph obtained from a path by some orientation of its edges. The set of all connected graphs that can be embedded in a given linear graph $L$ is ordered by embedding relation. Conditions on $L$ are found under which this ordered set is a lattice.
Keywords: path, linear graph, abstract subgraph of a graph, ordered set, lattice, binary vector, duality.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: V. N. Salii, “The system of abstract connected subgraphs of a linear graph”, Prikl. Diskr. Mat., 2012, no. 2(16), 90–94
Citation in format AMSBIB
\Bibitem{Sal12}
\by V.~N.~Salii
\paper The system of abstract connected subgraphs of a~linear graph
\jour Prikl. Diskr. Mat.
\yr 2012
\issue 2(16)
\pages 90--94
\mathnet{http://mi.mathnet.ru/pdm365}
Linking options:
  • https://www.mathnet.ru/eng/pdm365
  • https://www.mathnet.ru/eng/pdm/y2012/i2/p90
    • 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:225
    Full-text PDF :96
    References:41
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024