Distance-related invariants on polygraphs
From MaRDI portal
Recommendations
Cites work
- 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?)
- Algebraic approach to fasciagraphs and rotagraphs
- Minimax algebra
- The matching polynomial of a polygraph
Cited in
(9)- On the first Zagreb index of polygraphs
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
- scientific article; zbMATH DE number 2099356 (Why is no real title available?)
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs
- The matching polynomial of a polygraph
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- \(L(2,1)\)-labeling of direct product of paths and cycles
- The obnoxious center problem on weighted cactus graphs.
- Intensional properties of polygraphs
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)