نتایج جستجو برای: h decomposable graph

تعداد نتایج: 717739  

2007
Ladislav Stacho

In this paper we show that the complete graph K 12 is not decomposable into three factors with diameter two, which completes the solution of the problem of decomposition of complete graph into three factors from which the rst one has diameter two and the other factors have nite diameters.

Journal: :Int. J. Math. Mathematical Sciences 2005
Mohammed M. M. Jaradat

All graphs under consideration are nonnull, finite, undirected, and simple graphs. We adopt the standard notations dG(v) for the degree of the vertex v in the graph G, and ∆(G) for the maximum degree of the vertices of G. The edge chromatic number, χ′(G), of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. A graph i...

H. R. Maimani , M. Sabzevari ,

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

Journal: :Statistics & Probability Letters 2022

We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. also give results decomposable functions, improving Janson’s Hoeffding-type inequality the summation graph-dependent bounded variables. These extend McDiarmid’s difference to cases.

 The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this  graph. Also we give a relation between the order graph and prime  graph of a group.

1996
Jean-Claude Bermond Eric Darrot Olivier Delmas

In this paper we prove that the wrapped Butterry graph WBF(d;n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2.

2017
Mohamad Elmasri

Abstract: Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs. This is achieved through dimensionality expansion that causes the graph nodes to be conditionally independent given a latent tree. The Markov updat...

Journal: :Discussiones Mathematicae Graph Theory 2015
Francesco M. Malvestuto Marina Moscarini

An abstract convexity space on a connected hypergraph H with vertex set V (H) is a family C of subsets of V (H) (to be called the convex sets of H) such that: (i) C contains the empty set and V (H), (ii) C is closed under intersection, and (iii) every set in C is connected in H. A convex set X of H is a minimal vertex convex separator of H if there exist two vertices of H that are separated by ...

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

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 ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید