Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings

DOI10.1155/2015/463650zbMath1347.05033OpenAlexW2195677420WikidataQ59111845 ScholiaQ59111845MaRDI QIDQ327737

Krzysztof Piejko

Publication date: 19 October 2016

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

Full work available at URL: https://doi.org/10.1155/2015/463650

zbMATH Keywords

Fibonacci numbers in graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Uses Software

• OEIS

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
• On \(k\)-distance Pell numbers in 3-edge-coloured graphs
• The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers
• Some useful combinatorial formulas for bosonic operators
• Hadamard Product of Certain Classes of Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings