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

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

Journal: :Journal of Graph Theory 1995
David A. Pike

The main result of this paper completely settles Bermond's conjecture for bipartite graphs of odd degree by proving that if G is a bipartite (2k+1)-regular graph that is Hamilton decomposable, then the line graph, L(G), of G is also Hamilton decomposable. A similar result is obtained for 5-regular graphs, thus providing further evidence to support Bermond's conjecture.

Journal: :Electr. J. Comb. 2014
Türker Bíyíkoglu Yusuf Civan

We call a vertex x of a graph G = (V,E) a codominated vertex if NG[y] ⊆ NG[x] for some vertex y ∈ V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G − x is codismantlable. We show that (C4, C5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C4, C5, C7)-free well-covered graph, then ver...

2001
Robert Molina

A graph G is ramdomly H–decomposable if every family of edge disjoint subgraphs of G, each subgraph isomorphic to H , can be extended to an H–decomposition of G. Let Pk denote a path of length k. In this paper we characterize all ramdomly P3– decomposable graphs and ramdomly P4–decomposable graphs. We also characterize all ramdomly Pk–decomposable graphs of size 2k where all vertices have even ...

1999
Jung-Heum Park Hee-Chul Kim

We consider the dihamiltonian decomposition problem for 3-regular graphs. A graph G is dihamiltonian decomposable if in the digraph obtained from G by replacing each edge of G as two directed edges, the set of edges are partitioned into 3 edge-disjoint directed hamiltonian cycles. We suggest some conditions for dihamiltonian decomposition of 3-regular graphs: for a 3-regular graph G, it is diha...

Journal: :Electr. J. Comb. 2016
Iván D. Castrillón Roberto Cruz Enrique Reyes

Let G = (V,E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ∆G is pure shellable, R/I∆ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1, . . . , eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and she...

Journal: :Statistics and Computing 2009
Helen Armstrong Christopher K. Carter Kin Foon Kevin Wong Robert Kohn

Estimating a covariance matrix efficiently and discovering its structure are important statistical problems with applications in many fields. This article takes a Bayesian approach to estimate the covariance matrix of Gaussian data. We use ideas from Gaussian graphical models and model selection to construct a prior for the covariance matrix that is a mixture over all decomposable graphs, where...

2012
REN BETTENDORF

The purpose of this project is to show observations taken from the Iterative Proportional Scaling algorithm when used with data taken from Hierarchical LogLinear Models. We show with empirical proof that the difference between decomposable and non-decomposable graph models used is not exceedingly different. For the purpose of this project we looked at the properties of the two, three, and four ...

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

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