Chromatic polynomials of some nanostars
Authors
Abstract:
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
similar resources
chromatic polynomials of some nanostars
let g be a simple graph and (g,) denotes the number of proper vertex colourings of gwith at most colours, which is for a fixed graph g , a polynomial in , which is called thechromatic polynomial of g . using the chromatic polynomial of some specific graphs, weobtain the chromatic polynomials of some nanostars.
full textChromatic Polynomials of Some Nanotubes
Let ) , ( λ χ G denotes the number of proper vertex colourings of with at most G λ colours. G. Birkhoff , observed in 1912 that ) , ( λ χ G is, for a fixed graph , a polynomial in G λ , which is now called the chromatic polynomial of . More precisely, let G be a simple graph and G N ∈ λ . A mapping } , {1,2, ) ( : λ K → G V f is called a λ -colouring of if whenever the vertices and are adjacent...
full textSome Inequalities on Chromatic Polynomials
For a given graph G, let P (G,λ) be the chromatic polynomial of G, where λ is considered to be a real number. In this paper, we study the bounds for P (G,λ)/P (G,λ − 1) and P (G,λ)/P (G − x, λ), where x is a vertex in G, λ ≥ n and n is the number of vertices of G.
full textChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
full textSome Results on Chromatic Polynomials of Hypergraphs
In this paper, chromatic polynomials of (non-uniform) hypercycles, unicyclic hypergraphs, hypercacti and sunflower hypergraphs are presented. The formulae generalize known results for r-uniform hypergraphs due to Allagan, Borowiecki/ Lazuka, Dohmen and Tomescu. Furthermore, it is shown that the class of (non-uniform) hypertrees with m edges, where mr edges have size r, r ≥ 2, is chromatically c...
full textChromatic Polynomials Of Some (m, l)-Hyperwheels
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform (m, l)− hyperwheels and non-uniform (m, l)−hyperfans. These hypergraphs, constructed through a “join” graph operation, are some generalizations of the well-known wh...
full textMy Resources
Journal title
volume 3 issue 2
pages 127- 135
publication date 2012-09-01
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023