Independence in function graphs

zbMATH Open1335.05139MaRDI QIDQ2791981FDOQ2791981

Ralucca Gera, Ryan Pepper, Craig Rasmussen, Craig E. Larson

Publication date: 16 March 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

independencepermutation graphsgeneralized Petersen graphsfunction graphsgeneralized prismsfunctigraphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• The independence function and generalized Ramsey numbers
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence

   Recommendations

• On the independence graph of a graph 👍 👎
• Independence in connected graphs 👍 👎
• Independence in direct-product graphs 👍 👎
• Independent sets in graphs 👍 👎
• Independence and graph homomorphisms graph homomorphisms 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Independence in hypergraphs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Independence in function graphs

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