| Naslov: | Recognizing weighted directed Cartesian graph bundles |
|---|
| Avtorji: | ID Zmazek, Blaž (Avtor) ID Žerovnik, Janez (Avtor) |
| Datoteke: | Discussiones_Mathematicae_Graph_Theory_2000_Zmazek,_Zerovnik_Recognizing_weighted_directed_cartesian_graph_bundles.pdf (240,86 KB) MD5: B13BFD09296133BCEA4D4844419EDF39
http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1105
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Znanstveno delo |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | PEF - Pedagoška fakulteta
|
|---|
| Opis: | 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 |
|---|
| Ključne besede: | mathematics, graph theory, graph bundles, Cartesian graph product, weighted digraphs, half-convexity |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Leto izida: | 2000 |
|---|
| Št. strani: | str. 39-56 |
|---|
| Številčenje: | Letn. 20, št. 1 |
|---|
| PID: | 20.500.12556/DKUM-65352  |
|---|
| ISSN: | 1234-3099 |
|---|
| UDK: | 519.17 |
|---|
| COBISS.SI-ID: | 10205960  |
|---|
| ISSN pri članku: | 1234-3099 |
|---|
| NUK URN: | URN:SI:UM:DK:N75MZMEW |
|---|
| Datum objave v DKUM: | 31.03.2017 |
|---|
| Število ogledov: | 1521 |
|---|
| Število prenosov: | 527 |
|---|
| Metapodatki: |  |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |