The odd-even invariant for graphs

被引：2

作者：

Eager, Richard ^{[1
]}

Lawrence, Jim ^{[2
]}

机构：

[1] Thomas Jefferson High Sch Sci & Technol, Alexandria, VA USA

[2] George Mason Univ, Dept Math Sci, Fairfax, VA 22030 USA

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2015年 / 50卷

关键词：

D O I：

10.1016/j.ejc.2015.03.023

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The odd-even invariant for graphs is the graphic version of the odd-even invariant for oriented matroids. Here, simple properties of this invariant are verified, and for certain graphs, including chordal graphs and complete bipartite graphs, its value is determined. The odd-even chromatic polynomial is introduced, its coefficients are briefly studied, and it is shown that the absolute value of this polynomial at 1 equals the odd-even invariant, in analogy with the usual chromatic polynomial and the number of acyclic orientations. (C) 2015 Elsevier Ltd. All rights reserved.

引用

页码：87 / 96

页数：10

共 7 条

[1] Agnarsson G., 2007, Graph Theory: Modeling, Applications, and Algorithms, Pearson international edition
[2] [Anonymous], 1997, Enumerative Combinatorics
[3] Bjorner A., 1992, ENCY MATH
[4] Eager R., 2001, TEKNOS, V10, P33
[5] The odd-even invariant of an oriented matroid
Lawrence, J
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (06) : 806 - 813
[6] Stanley R. P., 1973, Discrete Mathematics, V5, P171, DOI 10.1016/0012-365X(73)90108-8
[7] 2 POSET POLYTOPES
STANLEY, RP
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (01) : 9 - 23

← 1 →