Chromaticity of Turan Graphs with At Most Three Edges Deleted
نویسندگان
چکیده مقاله:
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graphs.
منابع مشابه
Chromaticity of Bipartite Graphs with Five or Six Edges Deleted
For integers p, q, s with p ≥ q ≥ 2 and s ≥ 0, let K−s 2 (p, q) denote the set of 2−connected bipartite graphs which can be obtained from Kp,q by deleting a set of s edges. F.M.Dong et al. (Discrete Math. vol.224 (2000) 107–124) proved that for any graph G ∈ K−s 2 (p, q) with p ≥ q ≥ 3 and 0 ≤ s ≤ min{4, q−1}, then G is chromatically unique. In this paper, we shall extend this result to p ≥ q ≥...
متن کاملGraphs with Branchwidth at Most Three
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set of graphs with branchwidth at mo...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملChromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted
For integers p, q, s with p ≥ q ≥ 2 and s ≥ 0, let K−s 2 (p, q) denote the set of 2−connected bipartite graphs which can be obtained from Kp,q by deleting a set of s edges. In this paper, we prove that for any graph G ∈ K−s 2 (p, q) with p ≥ q ≥ 3, if 11 ≤ s ≤ q − 1 and ∆(G′) = s − 4, where G′ = Kp,q − G, then G is chromatically unique. This result extends both a theorem by Dong et al. [2] and ...
متن کاملRegular Projections of Graphs with at Most Three Double Points
We investigate some relations between a generic immersion of a graph into the 2-space with small number of double points and the embeddings of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space to the 2-space. Specifically we prove: (1) An embedding of a graph obtained from a generic immersion of the graph with at most three doub...
متن کاملChromaticity of Complete 6-Partite Graphs with Certain Star or Matching Deleted
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6n vertices according to the number of 7-independent partitions of G. Using these resul...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 9 شماره None
صفحات 45- 64
تاریخ انتشار 2014-11
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023