Distance-related invariants on polygraphs

DOI10.1016/S0166-218X(97)00069-3MaRDI QIDQ1377616zbMATH OpenOpenAlexWikidataFDO

Authors Martin Juvan, Bojan Mohar, Janez Žerovnik

Publication date 8 April 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

distancefasciagraphrotagraphWiener index

Mathematics Subject Classification ID

Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 2099356
• Algebraic approach to fasciagraphs and rotagraphs
• scientific article; zbMATH DE number 3987327
• Generic algorithms for some decision problems on fasciagraphs and rotagraphs

Cites work

• Algebraic approach to fasciagraphs and rotagraphs
• scientific article; zbMATH DE number 4147534 (Why is no real title available?)
• scientific article; zbMATH DE number 3711960 (Why is no real title available?)
• scientific article; zbMATH DE number 3619931 (Why is no real title available?)
• scientific article; zbMATH DE number 627763 (Why is no real title available?)
• scientific article; zbMATH DE number 720015 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• Minimax algebra
• The matching polynomial of a polygraph

Cited in

(10)

• The matching polynomial of a polygraph
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• The obnoxious center problem on weighted cactus graphs.
• \(L(2,1)\)-labeling of direct product of paths and cycles
• Algebraic approach to fasciagraphs and rotagraphs
• On the first Zagreb index of polygraphs
• A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
• Intensional properties of polygraphs
• Generic algorithms for some decision problems on fasciagraphs and rotagraphs
• scientific article; zbMATH DE number 2099356 (Why is no real title available?)

This page was built for publication: Distance-related invariants on polygraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377616)