. C O / 0 60 86 72 v 1 2 8 A ug 2 00 6 Factor - Critical Property in 3 - Dominating - Critical Graphs ∗

نویسنده

  • Qinglin Yu
چکیده

A vertex subset S of a graph G is a dominating set if every vertex of G either belongs to S or is adjacent to a vertex of S. The cardinality of a smallest dominating set is called the dominating number of G and is denoted by γ(G). A graph G is said to be γ-vertex-critical if γ(G− v) < γ(G), for every vertex v in G. Let G be a 2-connected K1,5-free 3-vertex-critical graph. For any vertex v ∈ V (G), we show that G − v has a perfect matching (except two graphs), which is a conjecture posed by Ananchuen and Plummer [2].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

m at h . C O ] 2 8 A ug 2 00 6 Factor - Critical Property in 3 - Dominating - Critical Graphs ∗

A vertex subset S of a graph G is a dominating set if every vertex of G either belongs to S or is adjacent to a vertex of S. The cardinality of a smallest dominating set is called the dominating number of G and is denoted by γ(G). A graph G is said to be γ-vertex-critical if γ(G− v) < γ(G), for every vertex v in G. Let G be a 2-connected K1,5-free 3-vertex-critical graph. For any vertex v ∈ V (...

متن کامل

ar X iv : c s . D M / 0 40 80 68 v 1 3 1 A ug 2 00 4 Probabilistic Analysis of Rule 2

Li and Wu proposed Rule 2, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. Here we study the asymptotic performance of Rule 2 on random unit disk graphs formed from n random points in an ln × ln square region of the plane. If ln = O( √ n/ logn), Rule 2 produces a dominating set whose expected size is O(n/(log logn)). keywords and phrases: c...

متن کامل

ar X iv : c on d - m at / 0 60 86 11 v 1 2 8 A ug 2 00 6 Excited state spectra at the superfluid - insulator transition out of paired condensates

We describe gapped single-particle and collective excitations across a superfluid to insulator quantum phase transition of particles (bosons or fermions) in a periodic potential, with an even number of particles per unit cell. We demonstrate that the dynamics is controlled by a quantum impurity problem of a localized particle interacting with the bulk critical modes. Critical exponents are dete...

متن کامل

ar X iv : 0 80 8 . 06 72 v 1 [ he p - ph ] 5 A ug 2 00 8 1 Status of Lattice Studies of the QCD Phase Diagram

Determining the QCD phase diagram is a pressing task in view of its relevance for nuclear and astro-particle physics programmes. We review the current status of lattice calculations of the phase diagram in the (T, μB)-plane for baryon chemical potentials μB < ∼ 500 MeV. At μB = 0, simulations of staggered fermion actions predict the quark hadron transition to be a crossover in the continuum lim...

متن کامل

A conjecture on k - factor - critical and 3 - γ - critical 1 graphs ∗

4 For a graph G = (V,E), a set S ⊆ V is a dominating set if every vertex in 5 V is either in S or is adjacent to a vertex in S. The domination number γ(G) 6 of G is the minimum order of a dominating set in G. A graph G is said to be 7 domination vertex critical, if γ(G− v) < γ(G) for any vertex v in G. A graph 8 G is domination edge critical, if γ(G∪ e) < γ(G) for any edge e / ∈ E(G). We 9 call...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006