Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Matrice adjacence")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 461

  • Page / 19
Export

Selection :

  • and

Sui tornei regolari e quasi regolari = Tournois réguliers et quasi-réguliers = Regular and quasi-regular tournamentsZAGAGLIA SALVI, N.Rendiconti - Istituto lombardo. Accademia di scienze e lettere. A. Scienze matematiche e applicazioni. 1981, Vol 115, pp 191-202, issn 0392-9523Article

The rank of the adjacency matrix of a graphVAN NUFFELEN, C.Bulletin de la Société mathématique de Belgique. Série B. 1983, Vol 35, Num 2, pp 219-226, issn 0771-1158Article

On the polynomial of a pathBEEZER, R. A.Linear algebra and its applications. 1984, Vol 63, Num 12, pp 221-225, issn 0024-3795Article

Bounds on graph spectraBRIGHAM, R. C; DUTTON, R. D.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 228-234, issn 0095-8956Article

On the determinant of the adjacency matrix for a planar sublatticeDEIFT, P. A; TOMEI, C.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 278-289, issn 0095-8956Article

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

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

Etudes de relations entre paramètres de graphes = Relations between graphs parametersSacle, Jean-François; Favaron, O.1995, 90 p.Thesis

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

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

  • Page / 19