Perturbed Fibonacci Recursion in Graph Construction

DOI10.1080/00150517.2024.2412959MaRDI QIDQ6957815zbMATH OpenFDO

Authors Peter Ulrickson, Paul C. Kainen

Publication date 16 July 2025

Published in The Fibonacci Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00150517.2024.2412959

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Total orders (06A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Calculation of integer sequences (11Y55)

Cites work

• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• Two poset polytopes

Cited in

(1)

• Construction numbers: how to build a graph

This page was built for publication: Perturbed Fibonacci Recursion in Graph Construction

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