Related papers: Weighted theta functions for non-commutative graph…
The theory of Ihara zeta functions is extended to infinite graphs which are weighted and of finite total weight. In this case one gets meromorphic instead of rational functions and the classical determinant formulas of Bass and Ihara hold…
Recently, Bauer et al. (J Graph Theory 55(4) (2007), 343--358) introduced a graph operator $D(G)$, called the $D$-graph of $G$, which has been useful in investigating the structural aspects of maximal Tutte sets in $G$ with a perfect…
The problems of computing graph colorings and clique covers are central challenges in combinatorial optimization. Both of these are known to be NP-hard, and thus computationally intractable in the worst-case instance. A prominent approach…
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
Starting from a self-dual formulation of gravity, we obtain a noncommutative theory of pure Einstein theory in four dimensions. In order to do that, we use Seiberg-Witten map. It is shown that the noncommutative torsion constraint is solved…
Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a…
We exploit the Seiberg -- Witten map technique to formulate the theory of gravity defined on a Lie algebraic noncommutative space time. Detailed expressions of the Seiberg -- Witten maps for the gauge parameters, gauge potentials and the…
We investigate the effect of the noncommutative geometry on the classical orbits of particles in a central force potential. The relation is implemented through the modified commutation relations $[x_i, x_j]=i \theta_{ij} $. Comparison with…
Noether's problem is classical and very important problem in algebra. It is an intrinsically interesting problem in invariant theory, but with far reaching applications in the sutdy of moduli spaces, PI-algebras, and the Inverse problem of…
The consistent form of the gauge anomaly is worked out at first order in $\theta$ for the noncommutative three-point function of the ordinary gauge field of certain noncommutative chiral gauge theories defined by means of the Seiberg-Witten…
The $L^2$-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y, the normalized zeta functions of the finite graphs converge to the $L^2$-zeta…
Recent work [hep-th/0504183,hep-th/0508002] indicates an approach to the formulation of diffeomorphism invariant quantum field theories (qft's) on the Groenewold-Moyal (GM) plane. In this approach to the qft's, statistics gets twisted and…
In this paper we couple noncommutative (NC) vielbein gravity to scalar fields. Noncommutativity is encoded in a star product between forms, given by an abelian twist (a twist with commuting vector fields). A geometric generalization of the…
Ordinary theta-functions can be considered as holomorphic sections of line bundles over tori. We show that one can define generalized theta-functions as holomorphic elements of projective modules over noncommutative tori (theta-vectors).…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
The Lov\'{a}sz theta number is a semidefinite programming bound on the clique number of (the complement of) a given graph. Given a vertex-transitive graph, every vertex belongs to a maximal clique, and so one can instead apply this…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…