Add to ORKGA class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for the chromatic polynomial of a graph of this type is proven. Finally, the chromatic polynomials of special cases of these graphs are explicitly computed. Key Words: chromatic polynomial, chromatically equivalent graphs, ladder graphs, generalized ladder graph
Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial. Two graphs G and H are chromatically ...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
A sufficient condition for two graphs with the same number of nodes to have the same chromatic polyn...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractWe give the definition of complete classes of chromatically equivalent graphs and some resul...
AbstractA generalized θ-graph in a connected graph with 3 paths between a pair of vertices of degree...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
AbstractLet G be a graph with order n and G¯ its complement. Denote by β(G) the minimum real root of...
Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial. Two graphs G and H are chromatically ...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
A sufficient condition for two graphs with the same number of nodes to have the same chromatic polyn...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractWe give the definition of complete classes of chromatically equivalent graphs and some resul...
AbstractA generalized θ-graph in a connected graph with 3 paths between a pair of vertices of degree...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
AbstractLet G be a graph with order n and G¯ its complement. Denote by β(G) the minimum real root of...
Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial. Two graphs G and H are chromatically ...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...