| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Recognizing weighted directed Cartesian graph bundles
Authors:ID Zmazek, Blaž (Author)
ID Žerovnik, Janez (Author)
Files:.pdf Discussiones_Mathematicae_Graph_Theory_2000_Zmazek,_Zerovnik_Recognizing_weighted_directed_cartesian_graph_bundles.pdf (240,86 KB)
MD5: B13BFD09296133BCEA4D4844419EDF39
 
URL http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1105
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:PEF - Faculty of Education
Abstract:In this paper we show that methods for recognizing Cartesian graph bundles can be generalized to weighted digraphs. The main result is an algorithm which lists the sets of degenerate arcs for all representations of digraph as a weighted directed Cartesian graph bundle over simple base digraphs not containing transitive tournament on three vertices. Two main notions are used.The first one is the new relation ▫$\vec{\delta}^\ast$▫ defined among the arcs of a digraph as a weighted directed analogue of the well-known relation ▫$\delta^\ast$▫. The second one is the concept of half-convex subgraphs. A subgraph ▫$H$▫ is half-convex in ▫$G$▫ if any vertex ▫$x \in G \setminus H$▫ has at most one predecessor and at most one successor
Keywords:mathematics, graph theory, graph bundles, Cartesian graph product, weighted digraphs, half-convexity
Publication status:Published
Publication version:Version of Record
Year of publishing:2000
Number of pages:str. 39-56
Numbering:Letn. 20, št. 1
PID:20.500.12556/DKUM-65352 New window
ISSN:1234-3099
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:10205960 New window
NUK URN:URN:SI:UM:DK:N75MZMEW
Publication date in DKUM:31.03.2017
Views:1518
Downloads:527
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:31.03.2017

Secondary language

Language:Slovenian
Title:Prepoznavanje uteženih usmerjenih kartezičnih grafovskih svežnjev
Abstract:Predstavljena je posplošitev prepoznavanja kartezičnih grafovskih svežnjev za utežene usmerjene grafe. Osrednji rezultat predstavlja algoritem, ki vrne množice degeneriranih vektorjev vseh predstavitev usmerjenih grafov v obliki uteženih usmerjenih kartezičnih grafovskih svežnjev nad baznimi grafi brez tranzitivnih turnirjev na treh točkah. Temeljna pojma pri izpeljavi tega rezutata sta relacija ▫$\vec{\delta}^\ast$▫ in polkonveksnost. Relacija ▫$\vec{\delta}^\ast$▫, definirana na množici vektorjev usmerjenega grafa, predstavlja posplošitev znane relacije ▫$\delta^\ast$▫. Podgraf ▫$H$▫ je polkonveksen v ▫$G$▫, če ima poljubna točka ▫$x \in G \setminus H$▫ največ enega predhodnika in največ enega naslednika.
Keywords:matematika, teorija grafov, grafovski svežnji, kartezični produkt grafov, uteženi digrafi, polkonveksnost


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica