AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic form, Q(x), on the n-tuple of indeterminates x = (x1, …, xn), given by Q(x) = Σ(xi − xj)2, where the sum is taken over all edges (i, j) of G. In this paper we prove that the quadratic forms Q1, Q2 associated with graphs G1, G2 are congruent by a unimodular matrix if and only if G1 and G2 are cycle isomorphic
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
AbstractLet Q = Q>(G) be an oriented vertex-edge incidence matrix for the graph G. Then K(G) = QtQ i...
AbstractLet G be a simple graph with n vertices and m edges. Denote by Q the vertex-edge incidence m...
AbstractWe relate the graph isomorphism problem to the classical problem of equivalence of integer q...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
AbstractA property of unimodularity is introduced for antisymmetric integral matrices. It is satisfi...
AbstractA. Schrijver proved that if A denotes the incidence matrix of a bidirected graph, and b is a...
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G +...
[[abstract]]Let G be a graph of order n and let View the MathML source be the characteristic polynom...
AbstractA decomposition theorem is established for square matrices A(s) defined over R[s], the ring ...
AbstractLet ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a...
AbstractIf G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degree...
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
AbstractLet Q = Q>(G) be an oriented vertex-edge incidence matrix for the graph G. Then K(G) = QtQ i...
AbstractLet G be a simple graph with n vertices and m edges. Denote by Q the vertex-edge incidence m...
AbstractWe relate the graph isomorphism problem to the classical problem of equivalence of integer q...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
AbstractA property of unimodularity is introduced for antisymmetric integral matrices. It is satisfi...
AbstractA. Schrijver proved that if A denotes the incidence matrix of a bidirected graph, and b is a...
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G +...
[[abstract]]Let G be a graph of order n and let View the MathML source be the characteristic polynom...
AbstractA decomposition theorem is established for square matrices A(s) defined over R[s], the ring ...
AbstractLet ϕ(G,λ)=∑k=0n(−1)kck(G)λn−k be the characteristic polynomial of the Laplacian matrix of a...
AbstractIf G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degree...
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...