Add to ORKGA graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. An H-shape is a tree with exactly two of its vertices having maximal degree 3. In this paper, a formula of counting the number of closed 6-walks is given on a graph, and some ne-cessary conditions of a graph Γ cospectral to an H-shape are given
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic gra...
In graph theory, graph decomposition is a typical problem. An H-decomposition of G is also called a ...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
he long continue his academic random walks. It is well known that the number of closed walks of leng...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractThe path spectrum of a graph is the set of lengths of all maximal paths in the graph. A set ...
AbstractA T-shape is a tree with exactly one of its vertices having maximal degree 3. It is proved i...
AbstractLet H(n;q,n1,n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 ...
summary:A graph is determined by its signless Laplacian spectrum if no other non-isomorphic graph ha...
Recently Csikvári [Combinatorica 30(2) 2010, 125-137] proved a conjecture of Nikiforov concerning th...
AbstractA graph G is defined to be semiharmonic if there is a constant μ (necessarily a natural numb...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
Let H(n; q, n(1), n(2)) be a graph with n vertices containing a cycle C(q) and two hanging paths P(n...
47 pages, 15 figuresIn this paper we study several problems concerning the number of homomorphisms o...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic gra...
In graph theory, graph decomposition is a typical problem. An H-decomposition of G is also called a ...
AbstractA graph G is said to be determined by its spectrum if any graph having the same spectrum as ...
he long continue his academic random walks. It is well known that the number of closed walks of leng...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractThe path spectrum of a graph is the set of lengths of all maximal paths in the graph. A set ...
AbstractA T-shape is a tree with exactly one of its vertices having maximal degree 3. It is proved i...
AbstractLet H(n;q,n1,n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 ...
summary:A graph is determined by its signless Laplacian spectrum if no other non-isomorphic graph ha...
Recently Csikvári [Combinatorica 30(2) 2010, 125-137] proved a conjecture of Nikiforov concerning th...
AbstractA graph G is defined to be semiharmonic if there is a constant μ (necessarily a natural numb...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
Let H(n; q, n(1), n(2)) be a graph with n vertices containing a cycle C(q) and two hanging paths P(n...
47 pages, 15 figuresIn this paper we study several problems concerning the number of homomorphisms o...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic gra...
In graph theory, graph decomposition is a typical problem. An H-decomposition of G is also called a ...