A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

定逆序数的n元数码置换个数的一种方法

一个确定的n元数码的排列,其道序数是不难求得的;反之,“已知逆序数,求有多少个n元置换”的问题要复杂得多。从最小数码的位置着手,充分利用逆序数是定数,给出一种解决此问题的新方法——最小数码定位法。此法通俗易懂,由此得到了逆序数为k(k=1,2,3……c_n~2)的n元数码的置换个数的一个递推公式:q_k(n)=1+q_1(n-l)+q_2(n-1)+q_3(n-1)+…+q_k(n-1)。     

4一致C-超图的最小边数问题

研究了上色数为3的4一致C-超图的最小边数问题，并给出了上色数为3的4一致C-超图的最小边数的一个上界．     

Real time estimation of CO2 laser weld quality for automotive industry

Laser welding is one of the most precise welding processes in joining sheet metals. In laser welding, performing real time evaluation of the welding quality is very important to enhance the efficiency of the welding process. In this study, the plasma and spatter, which are generated during laser welding, are measured using UV and IR photodiodes. The factors that influence weld quality are classified into five categories; optimal heat input, slightly low heat input, low heat input, partial joining due to gap mismatch, and nozzle deviation. The data number deviated from reference signals and their standard deviations were also considered to evaluate the qualities. A system was also formulated to perform real time evaluations of the weld quality using a fuzzy multi-feature pattern recognition with the measured signals.     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

LehmerDH数在模p剩余系的分布

设 p≥ 3为素数 ,集合A ={a|1≤a 相似文献   

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．     

Interference of probabilities and number field structure of quantum models

We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations.