Results 11 to 20 of about 568,566 (214)
Chromatic Polynomials of Simplicial Complexes [PDF]
Graphs and Combinatorics, 2012 In this note we consider $$s$$s-chromatic polynomials for finite simplicial complexes. When $$s=1$$s=1, the $$1$$1-chromatic polynomial is just the usual graph chromatic polynomial of the $$1$$1-skeleton.
J. Møller, Gesche Nord
semanticscholar +7 more sources
Chromatic Polynomials of Signed Book Graphs
Theory and Applications of Graphs, 2022 For $m \geq 3$ and $n \geq 1$, the $m$-cycle \textit{book graph} $B(m,n)$ consists of $n$ copies of the cycle $C_m$ with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed $B(m,n)$ is $n+1$, and (b) the ...
Deepak Sehrawat, Bikash Bhattacharjya
doaj +3 more sources
Polynomials related to chromatic polynomials [PDF]
, 2020 For a simple graph $G$, let $\chi(G,x)$ denote the chromatic polynomial of $G$. This manuscript introduces some polynomials which are related to chromatic polynomial and their relations.
F. Dong
semanticscholar +5 more sources
Chromatic polynomials of hypergraphs
Discussiones Mathematicae Graph Theory, 2000 Let \(q\geq 2\) and \(H_{q,q+1}^{n}\) be the \((q+1)\)-uniform hypergraph having vertex set \(X\) with \(|X|=n \geq q+1\) and edge set consisting of all sets \(Y\cup \{x_{i}\}\) for \(1\leq i\leq n-q \), where \(Y\subset X\), \(|Y|=q\) and \(\{x_{1},\ldots ,x_{n-q}\}\cup Y=X\).
Mieczyslaw Borowiecki, Ewa Lazuka
openaire +3 more sources
Chromatic polynomials of hypergraphs
Applied Mathematics Letters, 2007 The authors investigate the number of \(\lambda\)-colourings of the vertices of a hypergraph \(H\) such that each edge \(e_i\) of \(H\) contains at least \(x_i\) differently coloured vertices for given quantities \(x_1,\dots,x_m\) (one for each edge).
Ewa Drgas-Burchardt, Ewa Łazuka
exaly +2 more sources
On chromatic polynomials of hypergraphs
Electronic Notes in Discrete Mathematics, 2006 Abstract We consider a natural generalization of the chromatic polynomial of a graph. Let f ( x 1 , … , x m ) ( H , λ ) denote a number of different λ-colourings of a hypergraph H = ( X , E ) , X = { v 1 , … , v n } , E = { e 1 , … e m } , satisfying that in an edge e i
Ewa Drgas-Burchardt, Ewa Łazuka
exaly +2 more sources
Generalized chromatic polynomials
Discrete Mathematics, 1984 In the study of combinatorics there are several polynomials used including Birkhoff's chromatic polynomial for graphs, the study of Stanley's order polynomial for partially ordered sets and Tutte's dichromatic polynomial for graphs. The author develops a common basis for these polynomials.
Joyce, David
openaire +3 more sources
Point spread function estimation with computed wavefronts for deconvolution of hyperspectral imaging data [PDF]
Scientific ReportsHyperspectral imaging (HSI) systems acquire images with spectral information over a wide range of wavelengths but are often affected by chromatic and other optical aberrations that degrade image quality.
Miroslav Zabic +6 more
doaj +2 more sources
LLT polynomials, chromatic quasisymmetric functions and graphs with cycles [PDF]
Discrete Mathematics, 2017 We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as unicellular LLT polynomials, revealing some parallel structure and phenomena regarding their e -positivity ...
P. Alexandersson, G. Panova
semanticscholar +2 more sources
Coefficients of chromatic polynomials and tension polynomials
Contributions to Discrete Mathematics, 2011 We evaluate coefficients of chromatic polynomial of a graph G as sums of zero values of tension polynomials of certain "maximal" subgraphs of G.
Martin Kochol, Nad'a Krivonáková
openaire +2 more sources