Analytical treatment of higher-order graphs: a path ordinal method for solving graphs

DOI10.3390/SYM9110288MaRDI QIDQ2333465zbMATH OpenOpenAlexFDO

Authors Hala Kamal, Alicia Larena, Eusebio Bernabeu

Publication date 13 November 2019

Published in Symmetry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/sym9110288

zbMATH Keywords

cascade graphflow graphgraph orderlinear equationsmatrix algebrapath ordinalpath setpath set diagram

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

Summary: Analytical treatment of the composition of higher-order graphs representing linear relations between variables is developed. A path formalism to deal with problems in graph theory is introduced. It is shown how paths in the composed graph representing individual contributions to variables relation can be enumerated and represented by ordinals. The method allows for one to extract partial information and gives an alternative to classical graph approach.

Recommendations

• Ordinal network representation: Representing proximities by graphs
• scientific article; zbMATH DE number 4185659
• Graph compositions. I: Basic enumeration
• scientific article; zbMATH DE number 5812817
• scientific article; zbMATH DE number 4045115

Cites work

• Graph theory with applications
• On Flow Graph Solutions of Linear Algebraic Equations

This page was built for publication: Analytical treatment of higher-order graphs: a path ordinal method for solving graphs

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