نتایج جستجو برای: mycielskian

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

2011
Seema Varghese

The problem of monitoring an electric power system by placing as few phase measurement units (PMUs) in the system as possible is closely related to the well-known domination problem in graphs. The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in Mycielskian and generalized Mycielskian of graphs...

Journal: :Symmetry 2017
Ana Granados Domingo Pestana Ana Portilla José M. Rodríguez

Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...

Journal: :Discrete Mathematics 2010
Meysam Alishahi Hossein Hajiabolhassan

In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in [20] that t Mycielskian of the Kneser graph KG(m,n) has the same circular chromatic number and chromatic number provided that m + t is an even integer. We prove that if m is large enough, then χ(M (KG(m,n))) = χc(M (KG(m,n))) where M t is t Mycielskian. Also, we consider the generalized ...

Journal: :iranian journal of mathematical chemistry 2016
a. behtoei m. anbarloei

in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.

In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.

Journal: :Formalized Mathematics 2011

Journal: :Applied Mathematics Letters 2009

Journal: :Contributions to Discrete Mathematics 2008
Péter Csorba

Homomorphism complexes were introduced by Lovász to study topological obstructions to graph colorings. We show that folding in the second parameter of the homomorphism complex yields a homotopy equivalence. We study how the Mycielski construction changes the homotopy type of the homomorphism complex. We construct graphs showing that the topological bound obtained by odd cycles can be arbitraril...

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

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