Generalized sequences and k-independent sets in graphs
From MaRDI portal
Publication:608281
DOI10.1016/J.DAM.2010.08.006zbMATH Open1215.05128OpenAlexW2069023526MaRDI QIDQ608281FDOQ608281
Authors: Iwona Włoch, Andrzej 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
Recommendations
- Generalized Pell numbers, graph representations and independent sets
- scientific article; zbMATH DE number 5572943
- Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers
- Fibonacci numbers of trees
- Generalized Padovan numbers, Perrin numbers and maximal \(k\)-indpendent sets in graphs.
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Cited In (18)
- Generalized Fibonacci numbers and coordination sequences for decorated Bethe lattices
- Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture
- A class of generalized Tribonacci sequences applied to counting problems
- On types of distance Fibonacci numbers generated by number decompositions
- Generalized Padovan numbers, Perrin numbers and maximal \(k\)-indpendent sets in graphs.
- Fibonacci numbers of trees
- Generalized Pell numbers, graph representations and independent sets
- Title not available (Why is that?)
- A generalization of an independent set with application to \((K_q; k)\)-stable graphs
- The Fibonacci numbers of certain subgraphs of circulant graphs
- Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings
- Generalized Fibonacci–Leonardo numbers
- On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs
- Lucas graphs
- Title not available (Why is that?)
- On the Fibonacci numbers of the composition of graphs
- A graph-theoretic encoding of Lucas sequences
- On \(k\)-distance Pell numbers in 3-edge-coloured graphs
This page was built for publication: Generalized sequences and \(k\)-independent sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608281)
