Fibonacci-run graphs. II: Degree sequences

DOI10.1016/j.dam.2021.05.018zbMath1465.05031arXiv2010.05521OpenAlexW3164833512MaRDI QIDQ2030245

Vesna Iršič, Ömer Eğecioğlu

Publication date: 7 June 2021

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

Full work available at URL: https://arxiv.org/abs/2010.05521

zbMATH Keywords

generating functiondegree sequenceFibonacci cubeFibonacci-run graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex degrees (05C07)

Related Items (2)

Gray codes for Fibonacci \(q\)-decreasing words ⋮ The radius and center of Fibonacci-run graphs

Cites Work

• Unnamed Item
• Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
• Structure of Fibonacci cubes: a survey
• The irregularity polynomials of Fibonacci and Lucas cubes
• Boundary enumerator polynomial of hypercubes in Fibonacci cubes
• On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
• The degree sequence of Fibonacci and Lucas cubes
• \(q\)-cube enumerator polynomial of Fibonacci cubes
• Fibonacci-run graphs. I: Basic properties
• How Not to Repeatedly Differentiate a Reciprocal
• On domination-type invariants of Fibonacci cubes and hypercubes
• Statistics on restricted Fibonacci words
• Some diameter notions of Fibonacci cubes

This page was built for publication: Fibonacci-run graphs. II: Degree sequences