Results 41 to 50 of about 352 (69)

Small-span Hermitian matrices over quadratic integer rings

open access: yes, 2013
Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian matrix over ...
Greaves, Gary
core   +1 more source

Signed graphs with strong (anti-)reciprocal eigenvalue property

open access: yesSpecial Matrices
A (signed) graph is said to exhibit the strong reciprocal (anti-reciprocal) eigenvalue property (SR) (resp., (-SR)) if for any eigenvalue λ\lambda , it has 1λ\frac{1}{\lambda } (resp.,−1λ-\frac{1}{\lambda }) as an eigenvalue as well, with the same ...
Belardo Francesco, Huntington Callum
doaj   +1 more source

A determinant formula for the Jones polynomial of pretzel knots

open access: yes, 2012
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of ...
Burde G., Kauffman L. H., MOSHE COHEN
core   +1 more source

Computing the determinant of a signed graph

open access: yesOpen Mathematics
A signed graph is a simple graph in which every edge has a positive or negative sign. In this article, we employ several algebraic techniques to compute the determinant of a signed graph in terms of the spectrum of a vertex-deleted subgraph.
Alshamary Bader, Stanić Zoran
doaj   +1 more source

On the Potts model partition function in an external field

open access: yes, 2012
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we show that it ...
A.D. Sokal   +38 more
core   +2 more sources

The Clique Density Theorem

open access: yes, 2016
Tur\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \geq 2$ every graph on $n$ vertices with more than ${\tfrac{r-2}{2(r-1)}\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually adjacent ...
Reiher, Christian
core   +1 more source

On the spectral distribution of large weighted random regular graphs [PDF]

open access: yes, 2013
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs.
Goldmakher, Leo   +3 more
core  

Equistarable graphs and counterexamples to three conjectures on equistable graphs

open access: yes, 2014
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$.
Milanič, Martin, Trotignon, Nicolas
core  

Home - About - Disclaimer - Privacy