232 research outputs found
Lower Bounds and Series for the Ground State Entropy of the Potts Antiferromagnet on Archimedean Lattices and their Duals
We prove a general rigorous lower bound for
, the exponent of the ground state
entropy of the -state Potts antiferromagnet, on an arbitrary Archimedean
lattice . We calculate large- series expansions for the exact
and compare these with our lower bounds on
this function on the various Archimedean lattices. It is shown that the lower
bounds coincide with a number of terms in the large- expansions and hence
serve not just as bounds but also as very good approximations to the respective
exact functions for large on the various lattices
. Plots of are given, and the general dependence on
lattice coordination number is noted. Lower bounds and series are also
presented for the duals of Archimedean lattices. As part of the study, the
chromatic number is determined for all Archimedean lattices and their duals.
Finally, we report calculations of chromatic zeros for several lattices; these
provide further support for our earlier conjecture that a sufficient condition
for to be analytic at is that is a regular
lattice.Comment: 39 pages, Revtex, 9 encapsulated postscript figures, to appear in
Phys. Rev.
Chromatic equivalence class of the join of certain tripartite graphs
For a simple graph G, let P(G;λ) be the chromatic polynomial of G. Two graphs G and H are said to be chromatically equivalent, denoted G ~ H if P(G;λ) = P(H;λ). A graph G is said to be chromatically unique, if H ~ G implies that H ≅ G. Chia [4] determined the chromatic equivalence class of the graph consisting of the join of p copies of the path each of length 3. In this paper, we determined the chromatic equivalence class of the graph consisting of the join of p copies of the complete tripartite graph K1,2,3. MSC: 05C15;05C6
On Chromatic Uniqueness of Some Complete Tripartite Graphs
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equivalent iff P(G,x)=H(G,x). A graph G is called chromatically unique if G≃H for every H chromatically equivalent to G. In this paper, the chromatic uniqueness of complete tripartite graphs K(n1,n2,n3) is proved for n1⩾n2⩾n3⩾2 and n1−n3⩽5.The author is grateful to his scientific advisor prof. V. A. Baransky for constant attention and remarks
ON GARLANDS IN x-UNIQUELY COLORABLE GRAPHS
a graph G is called x-uniquely colorable, if all its x-colorings induce the same partion of the vertex set into one-color components. For x-uniquely colorable graphs new bound of the number of vertex set partions into x + 1 cocliques is found. © 2019 gein p.a
Chromaticity of a family of 5-partite graphs
AbstractLet 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 5-partite graphs G with 5n vertices according to the number of 6-independent partitions of G. Using these results, we investigate the chromaticity of G with certain stars or matching deleted parts . As a by-product, two new families of chromatically unique complete 5-partite graphs G with certain stars or matching deleted parts are obtained
An extensive English language bibliography on graph theory and its applications, supplement 1
Graph theory and its applications - bibliography, supplement
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
- …