کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
419704 683851 2009 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The bivariate Ising polynomial of a graph
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
The bivariate Ising polynomial of a graph
چکیده انگلیسی

In this paper we discuss the two variable Ising polynomials in a graph theoretical setting. This polynomial has its origin in physics as the partition function of the Ising model with an external field. We prove some basic properties of the Ising polynomial and demonstrate that it encodes a large amount of combinatorial information about a graph. We also give examples which prove that certain properties, such as the chromatic number, are not determined by the Ising polynomial. Finally we prove that there exist large families of non-isomorphic planar triangulations with identical Ising polynomial.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 157, Issue 11, 6 June 2009, Pages 2515–2524
نویسندگان
, ,