The Minimal Integral Separator of a Threshold Graph
نویسنده
چکیده
A graph is called threshold if there exists a real number b and real numbers aj associated with its vertices w, such that ims a, < b holds iff S is a stable (independent) set of vertices. The vector (a ,..., a; b) associated to a threshold graph is called an integral separator if ai + a > b + 1 for every edge (w,, wj). A simple algorithm is presented to determine for a given threshold graph its (unique) integral separator which minimizes b.
منابع مشابه
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs
This paper deals with the well known classes of threshold and difference graphs, both characterized by separators, i.e. node weight functions and thresholds. We show how to maintain minimum the value of the separator when the input (threshold or difference) graph is fully dynamic, i.e. edges/nodes are inserted/removed. Moreover, exploiting the data structure used for maintaining the minimality ...
متن کاملA threshold approach to connected domination
A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. We introduce and study the connected-domishold graphs, defined as graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a connected dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. More specifica...
متن کاملFinding Minimal D separators
We address the problem of nding a minimal separator in a di rected acyclic graph DAG namely nding a set Z of nodes that d separates a given pair of nodes such that no proper subset of Z d separates that pair We analyze several versions of this problem and o er polynomial algorithms for each These include nding a minimal separator from a restricted set of nodes nding a minimum cost separator and...
متن کاملThe Ring of Graph Invariants - Upper and Lower Bounds for Minimal Generators
In this paper we study the ring of graph invariants, focusing mainly on the invariants of simple graphs. We show that all other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this ring. In fact, every graph invariant is a linear combination of the basic graph invariants which we study in this paper. To prove that two graphs are isomorphic, a numbe...
متن کاملSpanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator S is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A clique is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size...
متن کامل