DOIAbstract
AbstractWe show that, if the eigenvalues of the adjacency matrix of a graph are distinct, then the group of automorphisms of the graph is Abelian
AbstractWe show that, if the eigenvalues of the adjacency matrix of a graph are distinct, then the group of automorphisms of the graph is Abelian
Eigenvalue of a graph is the eigenvalue of its adjacency matrix. The energy of a graph is the sum of...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractWe prove some results concerning necessary conditions for a graph to be Hamiltonian in terms...
AbstractWe show that, if the eigenvalues of the adjacency matrix of a graph are distinct, then the g...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
Let G be a graph with n vertices and m edges and let (G) = 1 (G) ::: n (G) be the eigenvalues of...
The spectra of graphs and their relation to graph properties have been well-studied. For digraphs, i...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
An automorphism of a graph G = (V,E) is a bijective map φ from V to itself such that φ(vi)φ(vj) ∈ E...
AbstractGiven a graph and a polynomial, a matrix can be constructed by evaluating the polynomial wit...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Eigenvalue of a graph is the eigenvalue of its adjacency matrix. The energy of a graph is the sum of...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractWe prove some results concerning necessary conditions for a graph to be Hamiltonian in terms...
AbstractWe show that, if the eigenvalues of the adjacency matrix of a graph are distinct, then the g...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
Let G be a graph with n vertices and m edges and let (G) = 1 (G) ::: n (G) be the eigenvalues of...
The spectra of graphs and their relation to graph properties have been well-studied. For digraphs, i...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
An automorphism of a graph G = (V,E) is a bijective map φ from V to itself such that φ(vi)φ(vj) ∈ E...
AbstractGiven a graph and a polynomial, a matrix can be constructed by evaluating the polynomial wit...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Eigenvalue of a graph is the eigenvalue of its adjacency matrix. The energy of a graph is the sum of...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractWe prove some results concerning necessary conditions for a graph to be Hamiltonian in terms...
Add to ORKG