Generalized Fibonacci maximum path graphs

DOI10.1016/0012-365X(79)90131-6MaRDI QIDQ1136779zbMATH OpenFDO

Authors Martin Charles Golumbic, Yehoshua Perl

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathdigraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cites work

• Deficient generalized Fibonacci maximum path graphs
• On Finding the Paths Through a Network
• The shortest route problem with constraints

Cited in

(8)

• Deficient generalized Fibonacci maximum path graphs
• A note on algebraic expressions of rhomboidal labeled graphs
• On lengths of edge-labeled graph expressions
• Maximum path digraphs
• Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
• Estimation of expressions' complexities for two-terminal directed acyclic graphs
• The number of spanning trees and maximum matchings of Fibonacci graphs
• On algebraic expressions of directed grid graphs

This page was built for publication: Generalized Fibonacci maximum path graphs

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