Independence in function graphs

MaRDI QIDQ2791981zbMATH OpenFDO

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

Publication date 16 March 2016

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

zbMATH Keywords

functigraphsfunction graphsgeneralized Petersen graphsgeneralized prismsindependencepermutation graphs

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)

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
• scientific article; zbMATH DE number 3722700
• scientific article; zbMATH DE number 1014511
• Independence in hypergraphs
• scientific article; zbMATH DE number 6011088

Cited in

(4)

• scientific article; zbMATH DE number 3722700 (Why is no real title available?)
• On the k-residue of disjoint unions of graphs with applications to k-independence
• The independence function and generalized Ramsey numbers
• Graph functionality

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)