APPLICATIONS OF THE THEORY OF SURFACES TO THE THEORY OF GRAPHSBERESINA LJ.1980; LECTURE NOTES MATH.; DEU; DA. 1980; NO 792; PP. 20-23Conference Paper

DIRECTED WEIGHTED HYPERGRAPHSVAN NUFFELEN C.1979; BULL. SOC. MATH. BELG.; BEL; DA. 1979; VOL. 31; NO 2; PP. 147-151; BIBL. 4 REF.Article

ON THE ISOMORPHISM OF DIGRAPHSSMADICI C; SMADICI L.1972; AN. STI. UNIV. "AL. I. CUZA" IASI, 1 A; ROMAN.; DA. 1972; VOL. 18; NO 2; PP. 297-298; ABS. ROUMSerial Issue

THE ALGEBRAIC MULTIPLICITY OF THE NUMBER ZERO IN THE SPECTRUM OF A BIPARTITE GRAPHCVETKOVIC DM; GUTMAN IM.1972; MAT. VES.; JUGOSL.; DA. 1972; VOL. 9; NO 2; PP. 141-150; BIBL. 1 P.Serial Issue

THE PFAFFIAN AND 1-FACTORS OF GRAPHS IIGIBSON PM.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 89-98; BIBL. 6 REF.Serial Issue

GRAPHS WITH NILPOTENT ADJACENCY MATRICESLIEBECK MW.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 2; PP. 215-218; BIBL. 1 REF.Article

ON RECOGNIZING GRAPH PROPERTIES FROM ADJACENCY MATRICES.RIVEST RL; VUILLEMIN J.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 371-384; BIBL. 16 REF.Article

STRUCTURAL CHARACTERIZATION OF STABILITY OF SIGNED DIGRAPHS UNDER PULSE PROCESSES.ROBERTS FS.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 330-338; BIBL. 6 REF.; (GRAPH AND COMB. PROC. CAP. CONF. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

COMMENTARY ON A TEST FOR GRAPH ISOMORPHISM.MASUYAMA M.1973; TRU MATH.; JAP.; DA. 1973; VOL. 9; PP. 69-84; BIBL. 2 REF.Article

COMPLEMENTS OF STEINHAUS GRAPHSDYMACEK WM.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 167-180; BIBL. 6 REF.Article

ON ALGORITHMS FOR ENUMERATING ALL CIRCUITS OF A GRAPH.PRABHAKER MATETI; NARSINGH DEO.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 90-99; BIBL. 1 P. 1/2Article

RELATION BETWEEN THE N-TH POWER OF THE ADJACENCY MATRIX AND THE NUMBER OF POINTS OF A COMPLETE GRAPH.VENKATESHA MURTHY TN.1974; CURR. SCI.; INDIA; DA. 1974; VOL. 43; NO 5; PP. 133-134; BIBL. 2 REF.Article

A SHARPENED VERSION OF THE AANDERAA-ROSENBERG CONJECTURE.BEST M; VAN EMDE BOAS P; LENSTRA HW JR et al.1974; STICHTG MATH. CENTRUM, AFD. ZUIVERE WISKDE; NEDERL.; DA. 1974; NO 30; PP. 1-20; BIBL. 8 REF.Article

THE SMALLEST GRAPHS WITH CERTAIN ADJACENCY PROPERTIESEXOO G; HARAPY F.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 29; NO 1; PP. 25-32; BIBL. 7 REF.Article

A NOTE ON COSPECTRAL GRAPHSJOHNSON CR; NEWMAN M.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 1; PP. 96-103; BIBL. 13 REF.Article

CARATTERIZZAZIONE MATRICIALE DEI GRAFI AUTODUALI = CARACTERISATION MATRICIELLE DES GRAPHES AUTODUAUXBALCONI G.1979; IST. LOMBARDO, REND. A, SCI. MAT. FIS. CHIM. GEOL.; ISSN 501425; ITA; DA. 1979 PUBL. 1980; VOL. 113; PP. 360-365; ABS. ENG; BIBL. 3 REF.Article

CHROMATIC NUMBER AND THE SPECTRUM OF A GRAPHCVETKOVIC DM.1973; PUBL. INST. MATH.; YOUGOSL.; DA. 1973; VOL. 14; NO 28; PP. 25-38; BIBL. 13 REF.Serial Issue

ON A SET OF PROOFS OF ISOMORPHISM OF ADJACENCY MATRICESALEKSIC TZ; DORDEVIC RZ.1972; UNIV. BEOGRADU, PUB. ELEKTROTECH. FAK., MAT. FITZ.; JUGOSL.; DA. 1972; NO 381-409; PP. 121-129; BIBL. 3 REF.Serial Issue

ON SPECTRAL STRUCTURE OF GRAPHS HAVING THE MAXIMAL EIGENVALUE NOT GREATER THAN TWO.CVETKOVIC DM; GUTMAN I.1975; PUBL. INST. MATH.; JUGOSL.; DA. 1975; VOL. 18; PP. 39-45; BIBL. 9 REF.Article

RANK AND DIAMETER OF A GRAPHVAN NUFFELEN C.1982; BULLETIN DE LA SOCIETE MATHEMATIQUE DE BELGIQUE. SERIE B; ISSN 0771-1158; BEL; DA. 1982; VOL. 34; NO 1; PP. 105-111; BIBL. 3 REF.Article

ON SPECTRAL CHARACTERIZATIONS AND EMBEDDINGS OF GRAPHSDOOB M; CVETKOVIC D.1979; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1979; VOL. 27; PP. 17-26; BIBL. 12 REF.Article

SYMMETRY AND MULTIPLE EIGENVALUES OF GRAPHS.SMITH JH.1977; GLASN. MAT.; JUGOSL.; DA. 1977; VOL. 12; NO 32; PP. 3-8; ABS. SLOVENE; BIBL. 9 REF.Article

AN ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A DIGRAPH.HSU HT.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 1; PP. 11-16; BIBL. 3 REF.Article

WORDS WITH PRESCRIBED ADJACENCIESKI HANG KIM; ROUSH F.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 26; NO 1; PP. 85-97; BIBL. 4 REF.Article

ALGORITHM 491. BASIC CYCLE GENERATION (H).GIBBS NE.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 5; PP. 275-276; BIBL. 1 REF.Article