Imagen de Portada

Sums of $k$-bonacci Numbers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Parks, Harold R., Wills, Dean C.
Formato:	Preprint
Publicado:	2022
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers
por: Parks, Harold R., et al.
Publicado: (2022)

Two eggs any style -- generalizing egg-drop experiments
por: Parks, Harold R., et al.
Publicado: (2022)

Dyck Paths Enumerated by the Q-bonacci Numbers
por: Barcucci, Elena, et al.
Publicado: (2024)

An Upper Bound on the Linear Turán Number of $k$-Crowns
por: Adak, Rajat
Publicado: (2026)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
por: Eze, L. C., et al.
Publicado: (2025)

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
por: Anand, Bijo S., et al.
Publicado: (2025)

On universal graphs for trees and treewidth $k$ graphs
por: Kaul, Neel, et al.
Publicado: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
por: Goetze, Miriam, et al.
Publicado: (2025)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
por: Arras, Patrick, et al.
Publicado: (2024)

Basis Number and Pathwidth
por: Miraftab, Babak, et al.
Publicado: (2026)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2023)

$k$-Hyperopic Cops and Robber
por: Crawford, Nicholas, et al.
Publicado: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)

On the Cop Number of String Graphs
por: Das, Sandip, et al.
Publicado: (2024)

Separation Number and Treewidth, Revisited
por: Houdrouge, Hussein, et al.
Publicado: (2025)

Treewidth of Outer $k$-Planar Graphs
por: Pyzik, Rafał
Publicado: (2025)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Bounds on Linear Turán Number for Trees
por: Adak, Rajat, et al.
Publicado: (2026)

A Survey on Ordered Ramsey Numbers
por: Balko, Martin
Publicado: (2025)

A Demigod's Number for the Rubik's Cube
por: Merino, Arturo, et al.
Publicado: (2024)

Characterizing Large Clique Number in Tournaments
por: Crew, Logan, et al.
Publicado: (2026)

Bounds on the Complete Forcing Number of Graphs
por: Ebrahimi, Javad B., et al.
Publicado: (2024)

On the Conjecture of the Representation Number of Bipartite Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

Basis Number of Graphs Excluding Minors
por: Geniet, Colin, et al.
Publicado: (2026)

Proper Rainbow Saturation Numbers for Cycles
por: Halfpap, Anastasia, et al.
Publicado: (2024)

On $k$-planar Graphs without Short Cycles
por: Bekos, Michael A., et al.
Publicado: (2024)

Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)

Antimagic Labeling of Graphs Using Prime Numbers
por: Islam, Arafat, et al.
Publicado: (2024)

Counting the Number of Domatic Partition of a Graph
por: Alikhani, Saeid, et al.
Publicado: (2024)

On 1-Planar Graphs with Bounded Cop-Number
por: Bose, Prosenjit, et al.
Publicado: (2024)

Representation Number of Word-Representable Split Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

Paired Disjunctive Domination Number of Middle Graphs
por: Golpek, Hande Tuncel, et al.
Publicado: (2025)

On $(k,g)$-Graphs without $(g+1)$-Cycles
por: Eze, Leonard Chidiebere, et al.
Publicado: (2024)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
por: Bharadwaj, et al.
Publicado: (2025)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
por: Schneider, Samuel, et al.
Publicado: (2025)

Using Graph Theory to Derive Inequalities for the Bell Numbers
por: Hertz, Alain, et al.
Publicado: (2021)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
por: Ai, Jiangdong, et al.
Publicado: (2024)

Structure and growth of $\mathbb{R}$-bonacci words
por: Dovgal, Sergey, et al.
Publicado: (2023)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
por: Goetze, Miriam, et al.
Publicado: (2024)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
por: Jungeblut, Paul, et al.
Publicado: (2022)