Connectedness of Products of Two Directed Graphs

摘要

Previous article Next article Connectedness of Products of Two Directed GraphsFrank Harary and Charles A. Trauth, Jr.Frank Harary and Charles A. Trauth, Jr.https://doi.org/10.1137/0114024PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Dorwin Cartwright and , Frank Harary, The number of lines in digraph of each connectedness category, SIAM Rev., 3 (1961), 309–314 10.1137/1003061 MR0179100 0112.14902 LinkISIGoogle Scholar[2] Frank Harary, , Robert Z. Norman and , Dorwin Cartwright, Structural models: An introduction to the theory of directed graphs, John Wiley & Sons Inc., New York, 1965ix+415 MR0184874 0139.41503 Google Scholar[3] M. H. McAndrew, On the product of directed graphs, Proc. Amer. Math. Soc., 14 (1963), 600–606 MR0151951 0133.16605 CrossrefGoogle Scholar[4] Gert Sabidussi, Graph multiplication, Math. Z., 72 (1959/1960), 446–457 10.1007/BF01162967 MR0209177 0093.37603 CrossrefGoogle Scholar[5] Paul M. Weichsel, The Kronecker product of graphs, Proc. Amer. Math. Soc., 13 (1962), 47–52 MR0133816 0102.38801 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Robotic Surveillance Based on the Meeting Time of Random WalksIEEE Transactions on Robotics, Vol. 36, No. 4 Cross Ref Boundary Vertices of Cartesian Product of Directed Graphs10 January 2019 | International Journal of Applied and Computational Mathematics, Vol. 5, No. 1 Cross Ref Some Results on Tensor Product of a Graph and an Odd Cycle18 July 2018 | National Academy Science Letters, Vol. 41, No. 4 Cross Ref Digraphs Products19 June 2018 Cross Ref Enabling massive deep neural networks with the GraphBLAS Cross Ref Constructing Adjacency Arrays from Incidence Arrays Cross Ref Mathematical foundations of the GraphBLAS Cross Ref A Generic Graph Model for WCET Analysis of Multi-Core Concurrent ApplicationsJournal of Software Engineering and Applications, Vol. 09, No. 05 Cross Ref Weak connectedness of tensor product of digraphsDiscrete Applied Mathematics, Vol. 185 Cross Ref Constructions28 October 2011 Cross Ref Near Products Cross Ref A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web SearchingVincent D. Blondel, Anahí Gajardo, Maureen Heymans, Pierre Senellart, and Paul Van Dooren4 August 2006 | SIAM Review, Vol. 46, No. 4AbstractPDF (598 KB)Similarity Matrices for Pairs of Graphs18 June 2003 Cross Ref Multiplicativity. Part I. Variations, multiplicative graphs, and digraphsJournal of Graph Theory, Vol. 15, No. 5 Cross Ref Introduction Cross Ref Conditional connectivityNetworks, Vol. 13, No. 3 Cross Ref Bibliography Cross Ref Cutpoints in the conjunction of two graphsArchiv der Mathematik, Vol. 31, No. 1 Cross Ref On Some Properties of n-Tournaments: A NoteM. S. Tyagi12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 28, No. 3AbstractPDF (260 KB)The chainable matrix, a special combinatorial matrixDiscrete Mathematics, Vol. 12, No. 3 Cross Ref On some Properties of n-TournamentsM. S. Tyagi17 February 2012 | SIAM Journal on Applied Mathematics, Vol. 24, No. 2AbstractPDF (781 KB)On Characterizing Tensor Composite GraphsAnnals of the New York Academy of Sciences, Vol. 175, No. 1 The Impac of Cross Ref On Characterizing Tensor Composite GraphsAnnals of the New York Academy of Sciences, Vol. 175, No. 1 Cross Ref Boolean Permanents, Permutation Graphs and ProductsJ. M. S. Simões Pereira12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 16, No. 6AbstractPDF (313 KB)Tournaments and Tensor Products of DigraphsMichael F. Capobianco13 July 2006 | SIAM Journal on Applied Mathematics, Vol. 15, No. 3AbstractPDF (288 KB)Kronecker products of fully indecomposable matrices and of ultrastrong digraphsJournal of Combinatorial Theory, Vol. 2, No. 2 Cross Ref Volume 14, Issue 2| 1966SIAM Journal on Applied Mathematics History Submitted:25 June 1965Published online:13 July 2006 InformationCopyright © 1966 Society for Industrial and Applied MathematicsPDF