Counting Representable Sets on Simple Graphs
نویسنده
چکیده
The graph-colouring problem may be generalised by allowing arbitrary constraints to be speciied on the colour combinations permitted at each pair of adjacent nodes. A set of colourings which is the solution to some network of speciied constraints is said to be a representable set. This paper derives exact expressions for the number of representable sets when the corresponding graph is cycle-free or series-parallel.
منابع مشابه
Regularity in mixed-integer convex representability
Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural nu...
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملRepresentation of finite graphs as difference graphs of S-units, I
Let S be a finite non-empty set of primes, ZS the ring of those rationals whose denominators are not divisible by primes outside S, and ZS the multiplicative group of invertible elements (S-units) in ZS . For a non-empty subset A of ZS , denote by GS(A) the graph with vertex set A and with an edge between a and b if and only if a − b ∈ ZS . This type of graphs has been studied by many people. I...
متن کاملExistence of u-Representation of Graphs
Recently, Jones et al. introduced the study of urepresentable graphs, where u is a word over {1, 2} containing at least one 1. The notion of a u-representable graph is a far-reaching generalization of the notion of a word-representable graph studied in the literature in a series of papers. Jones et al. have shown that any graph is 11 · · · 1-representable assuming that the number of 1s is at le...
متن کاملDominating Set Counting in Graph Classes
We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 47 شماره
صفحات -
تاریخ انتشار 1993