نتایج جستجو برای: h decomposable graph
تعداد نتایج: 717739 فیلتر نتایج به سال:
We show in this paper that the circulant graph G( 2”‘, 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @ 1997 Published by Elsevier Science B.V.
The motivation for this paper is the integer linear programming approach to learning the structure of a decomposable graphical model. We have chosen to represent decomposable models by means of special zero-one vectors, named characteristic imsets. Our approach leads to the study of a special polytope, defined as the convex hull of all characteristic imsets for chordal graphs, named the chordal...
a multicone graph is defined to be join of a clique and a regular graph. a graph $ g $ is cospectral with graph $ h $ if their adjacency matrices have the same eigenvalues. a graph $ g $ is said to be determined by its spectrum or ds for short, if for any graph $ h $ with $ spec(g)=spec(h)$, we conclude that $ g $ is isomorphic to $ h $. in this paper, we present new classes of multicone g...
We derive normal approximation bounds in the Wasserstein distance for sums of generalized U-statistics, based on a general bound functionals independent random variables arbitrary distributions. Those are applied to combined weights subgraphs Erdős–Rényi graph, extending graph counting results Barbour et al. (A central limit theorem decomposable with applications graphs, J. Combin. Theory Ser. ...
Applications of graph and hypergraph decomposition techniques to SAT solving have been studied under various conditions. Theoretical research focused on the direction given by tree decompositions, while practical approaches either integrated tree decomposition guidance into existing SAT solver, or studied splitting techniques using hypergraph cuts. In this article we present a uniform and gener...
We show that for all integers t ≥ 8 and arbitrarily small > 0, there exists a graph property Π (which depends on ) such that -testing Π has non-adaptive query complexity Q = Θ̃(q2−2/t), where q = Õ( −1) is the adaptive query complexity. This resolves the question of how bene cial adaptivity is, in the context of proximity-dependent properties ([GR07]). This also gives evidence that the canonical...
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...
Given N a non generic smooth CR submanifold of C, N = {(N, h(N))} where N is generic in C and h is a CR map from N into C. We prove, using only elementary tools, that if h is decomposable at p′ ∈ N then any decomposable CR distribution on N at p = (p′, h(p′)) extends holomorphically to a complex transversal wedge. This gives an elementary proof of the well known equivalent for totally real non ...
A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ disjoint decompositions of some simple (underlying) graph $ H $ into copies of a graph $ G. $ The number of copies of the graph $ G $ in each of the decompositions is the volume of the $ G $-trade and denoted by $ s. $ In this paper, we determine all values $ s $ for which there exists a $ mu $-way $ K_{1,m} $-trade of vo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید