Distance-related invariants on polygraphs (Q1377616): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q166210 |
Created claim: Wikidata QID (P12): Q128109455, #quickstatements; #temporary_batch_1722432210195 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Frank Plastria / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871775 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The matching polynomial of a polygraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4304869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimax algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4321958 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic approach to fasciagraphs and rotagraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3477977 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4182540 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088887891 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128109455 / rank | |||
Normal rank |
Latest revision as of 14:26, 31 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distance-related invariants on polygraphs |
scientific article |
Statements
Distance-related invariants on polygraphs (English)
0 references
8 April 1998
0 references
A fasciagraph (rotagraph) is obtained as \(n\) copies of a fixed base graph, sequentially linked in a linear (circular) way through a fixed set of vertex-pairs of the base graph. Tight bounds are derived on the distance matrix of a fasciagraph (rotagraph) in terms of the base graph's distance matrix. This allows approximation of the Wiener index (total distance sum of all pairs) of a fasciagraph (rotagraph), exact in several important cases.
0 references
distance
0 references
Wiener index
0 references
fasciagraph
0 references
rotagraph
0 references