Indecomposable regular graphs and hypergraphs
نویسندگان
چکیده
منابع مشابه
Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials
In this paper we study the distribution of eigenvalues of regular graphs , regular hypergraphs , and biregular bipartite graphs of given girth by considering the polynomials orthogonal with respect to the measures attached to the spectra of such graphs and to the continuous spectra of their ‘universal covers’ . Our estimates are tight for Biggs graphs and generalized polygons . We also give an ...
متن کاملPartially critical indecomposable graphs
Given a graph G = (V, E), with each subset X of V is associated the subgraph G(X) of G induced by X. A subset I of V is an interval of G provided that for any a, b ∈ I and x ∈ V \ I , {a, x} ∈ E if and only if {b, x} ∈ E. For example, ∅, {x}, where x ∈ V , and V are intervals of G called trivial intervals. A graph is indecomposable if all its intervals are trivial; otherwise, it is decomposable...
متن کاملMinimal indecomposable graphs
Let G=(V,E) be a graph, a subset X of V is an interval of G whenever for a, b E X and xE V X , (a,x)EE (resp. (x,a)EE) if and only if (b,x)EE (resp. (x,b)EE). For instance, 0, {x}, where x E V, and V are intervals of G, called trivial intervals. A graph G is then said to be indecomposable when all of its intervals are trivial. In the opposite case, we will say that G is decomposable. We now int...
متن کاملAnti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs
Let χ1(n) denote the maximum possible absolute value of an entry of the inverse of an n by n invertible matrix with 0, 1 entries. It is proved that χ1(n) = n 1 2. This solves a problem of Graham and Sloane. Let m(n) denote the maximum possible number m such that given a set of m coins out of a collection of coins of two unknown distinct weights, one can decide if all the coins have the same wei...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90590-c