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

DOI10.1155/2015/463650MaRDI QIDQ327737zbMATH OpenOpenAlexWikidataFDO

Authors Krzysztof Piejko

Publication date 19 October 2016

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• scientific article; zbMATH DE number 6823083
• Extremal \(H\)-colorings of trees and 2-connected graphs
• On an extremal problem for colored trees
• Maximum colored trees in edge-colored graphs
• Maximum properly colored trees in edge-colored graphs
• Edge-b-coloring trees
• Extremal problems on detectable colorings of trees
• A note on edge colorings and trees
• Trees with extremal numbers of \(k\)-dominating sets
• On characterizations of trees having large \((2, 0)\)-chromatic numbers

Cites work

• scientific article; zbMATH DE number 5572943 (Why is no real title available?)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Distance Fibonacci numbers, distance Lucas numbers and their applications.
• General approach in computing sums of products of binary sequences
• Generalized sequences and \(k\)-independent sets in graphs
• Hadamard Product of Certain Classes of Functions
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On Pell numbers and \((k_1A_1,k_2A_2,k_3A_3)\)-edge colouring in graphs.
• On \(k\)-distance Pell numbers in 3-edge-coloured graphs
• On the generalized Fibonacci and Pell sequences by Hessenberg matrices.
• On the usual Fibonacci and generalized order-\(k\) Pell numbers.
• Some useful combinatorial formulas for bosonic operators
• The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers
• The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums
• \((k,\alpha _{n-1})\)-Fibonacci numbers and \(P_k\)-matchings in multigraphs.

Cited in

(5)

• Maximizing and minimizing the number of generalized colorings of trees
• On Fibonacci numbers in edge coloured trees
• Extremal problems on detectable colorings of trees
• On an extremal problem for colored trees
• scientific article; zbMATH DE number 6700486 (Why is no real title available?)

Describes a project that uses

Uses Software

• OEIS

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

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