Some special realizations of partition matrix sequencesMAJCHER, Z.Discrete mathematics. 1993, Vol 121, Num 1-3, pp 159-175, issn 0012-365XConference Paper

Starlike trees whose maximum degree exceed 4 are determined by their Q-spectraCHANGJIANG BU; JIANG ZHOU.Linear algebra and its applications. 2012, Vol 436, Num 1, pp 143-151, issn 0024-3795, 9 p.Article

Ternary codes from graphs on triplesKEY, J. D; MOORI, J; RODRIGUES, B. G et al.Discrete mathematics. 2009, Vol 309, Num 14, pp 4663-4681, issn 0012-365X, 19 p.Article

A note on the irregularity of graphsBELL, F. K.Linear algebra and its applications. 1992, Vol 161, pp 45-54, issn 0024-3795Article

Signed graphs with least eigenvalue <-2SINGHI, N. M; VIJAYAKUMAR, G. R.European journal of combinatorics. 1992, Vol 13, Num 3, pp 219-220, issn 0195-6698Article

Exactly k-to-1 maps between graphsHEATH, J; HILTON, A. J. W.Transactions of the American Mathematical Society. 1992, Vol 331, Num 2, pp 771-785, issn 0002-9947Article

The distance spectrum of a treeMERRIS, R.Journal of graph theory. 1990, Vol 14, Num 3, pp 365-369, issn 0364-9024Article

Graph isomorphism and theorems of Birkhoff typeTINHOFER, G.Computing (Wien. Print). 1986, Vol 36, Num 4, pp 285-300, issn 0010-485XArticle

The complement of the path is determined by its spectrumDOOB, Michael; HAEMERS, Willem H.Linear algebra and its applications. 2002, Vol 356, pp 57-65, issn 0024-3795Article

Character tables of fission schemes and fusion schemesBANNAI, E; SUNG YELL SONG.European journal of combinatorics. 1993, Vol 14, Num 5, pp 385-396, issn 0195-6698Article

No antitwins in minimal imperfect graphsOLARIUS, S.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 2, pp 255-257, issn 0095-8956Article

Unimodularity and circle graphsBOUCHET, A.Discrete mathematics. 1987, Vol 66, Num 1-2, pp 203-208, issn 0012-365XArticle

Permutation decoding for binary codes from lattice graphsKEY, J. D; SENEVIRATNE, P.Discrete mathematics. 2008, Vol 308, Num 13, pp 2862-2867, issn 0012-365X, 6 p.Article

Some relations between rank of a graph and its complementAKBARI, Saieed; ALIPOUR, Alireza; JAVAD EBRAHIMI BOROOJENI et al.Linear algebra and its applications. 2007, Vol 422, Num 1, pp 341-347, issn 0024-3795, 7 p.Article

Upper bounds on the spectral radius of book-free and/or K_2,l-free graphsLINGSHENG SHI; ZHIPENG SONG.Linear algebra and its applications. 2007, Vol 420, Num 2-3, pp 526-529, issn 0024-3795, 4 p.Article

Equiangular tight frames from Paley tournamentsRENES, Joseph M.Linear algebra and its applications. 2007, Vol 426, Num 2-3, pp 497-501, issn 0024-3795, 5 p.Article

{-1, 0, 1}-Basis for the null space of a forestAKBARI, Saieed; ALIPOUR, Alireza; GHORBANI, Ebrahim et al.Linear algebra and its applications. 2006, Vol 414, Num 2-3, pp 506-511, issn 0024-3795, 6 p.Article

Spectral properties of contact matrix : Application to proteinsSADOC, J. F.The European physical journal. E, Soft matter (Print). 2005, Vol 18, Num 3, pp 321-333, issn 1292-8941, 13 p.Article

Imminant polynomilas of graphsBALASUBRAMANIAN, K.Theoretica chimica acta. 1993, Vol 85, Num 5, pp 379-390, issn 0040-5744Article

Laplacian permanents of treesBOTTI, P; MERRIS, R; VEGA, C et al.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 460-466, issn 0895-4801Article

Pairing theorem of graph eigenvalues : its new proof and a generalizationSHEN, M.International journal of quantum chemistry. 1990, Vol 37, Num 2, pp 121-123, issn 0020-7608, 3 p.Article

A counterexample to the rank-coloring conjectureALON, N; SEYMOUR, P. D.Journal of graph theory. 1989, Vol 13, Num 4, pp 523-525, issn 0364-9024Article

A heuristic method for the determination of a hamiltonian circuit in a graphKARMAKAR, S. B.Journal of the Australian Mathematical Society. Series B. Applied mathematics. 1987, Vol 28, Num 3, pp 328-339, issn 0334-2700Article

Bounding the largest eigenvalue of trees in terms of the largest vertex degreeSTEVANOVIC, Dragan.Linear algebra and its applications. 2003, Vol 360, pp 35-42, issn 0024-3795, 8 p.Article

Page / 17