k-Combinations of an unlabelled graph

zbMATH Open1349.05172MaRDI QIDQ2806633FDOQ2806633

Authors: M. R. Ebrahimi Vishki, K. Mirzavaziri, Madjid Mirzavaziri 

Publication date: 18 May 2016

Published in: Creative Mathematics and Informatics (Search for Journal in Brave)

Recommendations

• Combinatorial labelings of graphs
• On Labeled and Unlabeled Combinatorial Structures
• Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected
• Enumeration of unlabelled mating graphs
• Enumeration of unlabeled uniform hypergraphs
• Enumeration of unlabelled graphs with specified degree parities
• Combinatorics of \(k\)-Farey graphs
• scientific article; zbMATH DE number 2192213
• scientific article; zbMATH DE number 279643
• \(L(2,1)\)-labelings on the composition of \(n\) graphs

zbMATH Keywords

binomial coefficientbinomial expansion\(k\)-combination\(k\)-combination of an unlabelled graphgraph binomial coefficientgraph binomial expansion

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Binomial coefficients; factorials; (q)-identities (11B65)

Cited In (3)

• On Labeled and Unlabeled Combinatorial Structures
• The number of certain \(k\)-combinations of an \(n\)-set
• Title not available (Why is that?)

This page was built for publication: \(k\)-Combinations of an unlabelled graph

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