On \(k\)-distance Pell numbers in 3-edge-coloured graphs

DOI10.1155/2014/428020zbMath1442.05066OpenAlexW2007373641WikidataQ59051362 ScholiaQ59051362MaRDI QIDQ2336420

Iwona Włoch, Krzysztof Piejko

Publication date: 19 November 2019

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

Full work available at URL: https://doi.org/10.1155/2014/428020

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (4)

One-parameter generalization of dual-hyperbolic Pell numbers ⋮ Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings ⋮ On a new one parameter generalization of Pell numbers ⋮ On some combinatorial properties of \(P(r,n)\)-Pell quaternions

Cites Work

• The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Generalized sequences and \(k\)-independent sets in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(k\)-distance Pell numbers in 3-edge-coloured graphs