Generalized sequences and \(k\)-independent sets in graphs

DOI10.1016/j.dam.2010.08.006zbMath1215.05128MaRDI QIDQ608281

Iwona Włoch, Andrezej Włoch

Publication date: 25 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.006

zbMATH Keywords

Fibonacci numbers; \(k\)-independent set; pell numbers

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

The Fibonacci numbers of certain subgraphs of circulant graphs, Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings, On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs, On the Fibonacci numbers of the composition of graphs, A class of generalized Tribonacci sequences applied to counting problems, On \(k\)-distance Pell numbers in 3-edge-coloured graphs, On types of distance Fibonacci numbers generated by number decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• (k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings