A survey on integral graphs
K Balińska, D Cvetković, Z Radosavljević… - Publikacije …, 2002 - JSTOR
A SURVEY ON INTEGRAL GRAPHS Page 1 Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 13
(2002), 42-65. A SURVEY ON INTEGRAL GRAPHS K. Balińska, D. Cvetkovió, Z. Radosavljevič …
(2002), 42-65. A SURVEY ON INTEGRAL GRAPHS K. Balińska, D. Cvetkovió, Z. Radosavljevič …
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution
of a random walk on the web graph. A fibration of graphs is a morphism that is a local …
of a random walk on the web graph. A fibration of graphs is a morphism that is a local …
[PDF][PDF] Balanced integral trees
P Hic, R Nedela - Mathematica Slovaca, 1998 - dml.cz
A graph G is called integral if all the zeros of the characteristic polynomial P (C7; A) are
integers. In the present paper we investigate the question which trees are integral. Some …
integers. In the present paper we investigate the question which trees are integral. Some …
Homomorphisms, representations and characteristic polynomials of digraphs
A Deng, I Sato, Y Wu - Linear algebra and its applications, 2007 - Elsevier
The existence of a homomorphism between two digraphs often implies many structural
properties. We collect in this paper some characterizations of various digraph …
properties. We collect in this paper some characterizations of various digraph …
[HTML][HTML] Integral complete 4-partite graphs
P Híc, M Pokorný - Discrete mathematics, 2008 - Elsevier
Integral complete 4-partite graphs - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
Characteristic polynomials of digraphs having a semi-free action
A Deng, Y Wu - Linear algebra and its applications, 2005 - Elsevier
Let ϕ be a semi-free action of a group G on a finite digraph Γ. The front divisor Γ/π (ϕ) of Γ
has as vertex set the set of the vertex orbits of ϕ and there are t arcs going from u¯ to v¯ in …
has as vertex set the set of the vertex orbits of ϕ and there are t arcs going from u¯ to v¯ in …
New sufficient conditions for integral complete 3-partite graphs
P Híc, M Polorný, P Černek - Applicable Analysis and Discrete Mathematics, 2008 - JSTOR
NEW SUFFICIENT CONDITIONS FOR INTEGRAL COMPLETE 3-PARTITE GRAPHS Page 1
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu …
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu …
[HTML][HTML] Characteristic polynomials of ramified uniform covering digraphs
A Deng, I Sato, Y Wu - European Journal of Combinatorics, 2007 - Elsevier
We give a decomposition formula for the characteristic polynomials of ramified uniform
covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic …
covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic …
There are integral trees of diameter 7
P Hic, M Pokorný - Publikacije Elektrotehničkog fakulteta. Serija …, 2007 - JSTOR
THERE ARE INTEGRAL TREES OF DIAMETER 7 Page 1 Univ. Beograd. Publ. Elektrotehn.
Fak. Sor. Mat. 18 (200(5) , 59 03. Available electronically at http: //pefmath.etf.bg.ac.yu THERE …
Fak. Sor. Mat. 18 (200(5) , 59 03. Available electronically at http: //pefmath.etf.bg.ac.yu THERE …
[PDF][PDF] Graph fibrations, graph isomorphism, and PageRank
PBVLM Santini, S Vigna - vigna.di.unimi.it
PageRank is a ranking method that assigns scores to web pages using the limit distribution
of a random walk on the web graph. A fibration of graphs is a morphism that is a local …
of a random walk on the web graph. A fibration of graphs is a morphism that is a local …