Gotowa bibliografia na temat „Spanning graphs of hypercubes”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Spanning graphs of hypercubes”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Spanning graphs of hypercubes"
Kobeissi, Mohamed, i Michel Mollard. "Disjoint cycles and spanning graphs of hypercubes". Discrete Mathematics 288, nr 1-3 (listopad 2004): 73–87. http://dx.doi.org/10.1016/j.disc.2004.08.005.
Pełny tekst źródłaKobeissi, Mohamed, i Michel Mollard. "Spanning graphs of hypercubes: starlike and double starlike trees". Discrete Mathematics 244, nr 1-3 (luty 2002): 231–39. http://dx.doi.org/10.1016/s0012-365x(01)00086-3.
Pełny tekst źródłaLIN, LAN, i YIXUN LIN. "The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids". Journal of Interconnection Networks 20, nr 01 (marzec 2020): 2050004. http://dx.doi.org/10.1142/s0219265920500048.
Pełny tekst źródłaRIORDAN, OLIVER. "Spanning Subgraphs of Random Graphs". Combinatorics, Probability and Computing 9, nr 2 (marzec 2000): 125–48. http://dx.doi.org/10.1017/s0963548399004150.
Pełny tekst źródłaYANG, JINN-SHYONG, JOU-MING CHANG, SHYUE-MING TANG i YUE-LI WANG. "CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)". International Journal of Foundations of Computer Science 21, nr 01 (luty 2010): 73–90. http://dx.doi.org/10.1142/s0129054110007143.
Pełny tekst źródłaTien, Jenn-Yang, i Wei-Pang Yang. "Hierarchical spanning trees and distributing on incomplete hypercubes". Parallel Computing 17, nr 12 (grudzień 1991): 1343–60. http://dx.doi.org/10.1016/s0167-8191(05)80002-x.
Pełny tekst źródłaPai, Kung-Jui. "Dual Protection Routing Trees on Graphs". Mathematics 11, nr 14 (24.07.2023): 3255. http://dx.doi.org/10.3390/math11143255.
Pełny tekst źródłaYang, Jinn-Shyong, Shyue-Ming Tang, Jou-Ming Chang i Yue-Li Wang. "Parallel construction of optimal independent spanning trees on hypercubes". Parallel Computing 33, nr 1 (luty 2007): 73–79. http://dx.doi.org/10.1016/j.parco.2006.12.001.
Pełny tekst źródłaNieminen, Juhani, Matti Peltola i Pasi Ruotsalainen. "On Graphs Like Hypercubes". Tsukuba Journal of Mathematics 32, nr 1 (czerwiec 2008): 37–48. http://dx.doi.org/10.21099/tkbjm/1496165191.
Pełny tekst źródłaLocke, Stephen C., i Richard Stong. "Spanning Cycles in Hypercubes: 10892". American Mathematical Monthly 110, nr 5 (maj 2003): 440. http://dx.doi.org/10.2307/3647840.
Pełny tekst źródłaRozprawy doktorskie na temat "Spanning graphs of hypercubes"
Kobeissi, Mohamed. "Plongement de graphes dans l'hypercube". Phd thesis, Grenoble 1, 2001. https://theses.hal.science/tel-00004683.
Pełny tekst źródłaVasquez, Maria Rosario. "An investigation of super line graphs of hypercubes". Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865951.
Pełny tekst źródłaDepartment of Computer Science
Montgomery, Richard Harford. "Minors and spanning trees in graphs". Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709278.
Pełny tekst źródłaKnox, Fiachra. "Embedding spanning structures in graphs and hypergraphs". Thesis, University of Birmingham, 2013. http://etheses.bham.ac.uk//id/eprint/4027/.
Pełny tekst źródłaMahoney, James Raymond. "Tree Graphs and Orthogonal Spanning Tree Decompositions". PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/2944.
Pełny tekst źródłaCairncross, Emily. "Proper 3-colorings of cycles and hypercubes". Oberlin College Honors Theses / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1621606265779497.
Pełny tekst źródłaWong, Wiseley. "Spanning trees, toughness, and eigenvalues of regular graphs". Thesis, University of Delaware, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3595000.
Pełny tekst źródłaSpectral graph theory is a branch of graph theory which finds relationships between structural properties of graphs and eigenvalues of matrices corresponding to graphs. In this thesis, I obtain sufficient eigenvalue conditions for the existence of edge-disjoint spanning trees in regular graphs, and I show this is best possible. The vertex toughness of a graph is defined as the minimum value of [special characters omitted], where S runs through all subsets of vertices that disconnect the graph, and c(G\S ) denotes the number of components after deleting S. I obtain sufficient eigenvalue conditions for a regular graph to have toughness at least 1, and I show this is best possible. Furthermore, I determine the toughness value for many families of graphs, and I classify the subsets S of each family for when this value is obtained.
King, Andrew James Howell. "On decomposition of complete infinite graphs into spanning trees". Thesis, University of Reading, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.253454.
Pełny tekst źródłaZhang, Yuanping. "Counting the number of spanning trees in some special graphs /". View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20ZHANG.
Pełny tekst źródłaKoo, Cheng Wai. "A Bound on the Number of Spanning Trees in Bipartite Graphs". Scholarship @ Claremont, 2016. https://scholarship.claremont.edu/hmc_theses/73.
Pełny tekst źródłaKsiążki na temat "Spanning graphs of hypercubes"
Deza. Scale-isometric polytopal graphs in hypercubes and cubic lattices: Polytopes in hypercubes and Zn̳. London: Imperial College Press, 2004.
Znajdź pełny tekst źródłaGrishukhin, Viacheslav, Mikhail I. Shtogrin i Michel-Marie Deza. Scale-Isometric Polytopal Graphs in Hypercubes and Cubic Lattices: Polytopes in Hypercubes and Zn. Imperial College Press, 2004.
Znajdź pełny tekst źródłaSpanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach. World Scientific Publishing Co Pte Ltd, 2014.
Znajdź pełny tekst źródłaCzęści książek na temat "Spanning graphs of hypercubes"
Jungnickel, Dieter. "Spanning Trees". W Graphs, Networks and Algorithms, 99–127. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03822-2_4.
Pełny tekst źródłaJungnickel, Dieter. "Spanning Trees". W Graphs, Networks and Algorithms, 103–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32278-5_4.
Pełny tekst źródłaHo, Ching-Tien. "Spanning Trees and Communication Primitives on Hypercubes". W Parallel Computing on Distributed Memory Multiprocessors, 47–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-58066-6_3.
Pełny tekst źródłaAkitaya, Hugo A., Maarten Löffler i Csaba D. Tóth. "Multi-colored Spanning Graphs". W Lecture Notes in Computer Science, 81–93. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50106-2_7.
Pełny tekst źródłaDeza, Michel Marie, i Monique Laurent. "Isometric Embeddings of Graphs into Hypercubes". W Algorithms and Combinatorics, 283–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-04295-9_19.
Pełny tekst źródłaInoue, Keisuke, i Takao Nishizeki. "Spanning Distribution Forests of Graphs". W Frontiers in Algorithmics, 117–27. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08016-1_11.
Pełny tekst źródłaKawabata, Masaki, i Takao Nishizeki. "Spanning Distribution Trees of Graphs". W Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 153–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38756-2_17.
Pełny tekst źródłaBaumslag, M., M. C. Heydemann, J. Opatrny i D. Sotteau. "Embeddings of shuffle-like graphs in hypercubes". W Parle ’91 Parallel Architectures and Languages Europe, 179–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-662-25209-3_13.
Pełny tekst źródłaKano, Mikio, Tomoki Yamashita i Zheng Yan. "Spanning Caterpillars Having at Most k Leaves". W Computational Geometry and Graphs, 95–100. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45281-9_9.
Pełny tekst źródłaHeun, Volker, i Ernst W. Mayr. "Embedding graphs with bounded treewidth into optimal hypercubes". W STACS 96, 155–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-60922-9_14.
Pełny tekst źródłaStreszczenia konferencji na temat "Spanning graphs of hypercubes"
Qian, Yu, Baolei Cheng, Jianxi Fan, Yifeng Wang i Ruofan Jiang. "Edge-disjoint spanning trees in the line graph of hypercubes". W 2021 IEEE 32nd International Conference on Application-specific Systems, Architectures and Processors (ASAP). IEEE, 2021. http://dx.doi.org/10.1109/asap52443.2021.00017.
Pełny tekst źródłaYang, Jinn-Shyong, Jou-Ming Chang i HungChang Chan. "Independent Spanning Trees on Folded Hypercubes". W 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.55.
Pełny tekst źródłaAl-Tawil, Khalid, i Dimiter Avresky. "Reconfiguration of Spanning Trees in Faulty Hypercubes". W 1994 International Conference on Parallel Processing (ICPP'94). IEEE, 1994. http://dx.doi.org/10.1109/icpp.1994.173.
Pełny tekst źródłaJiang, Qiang-rong, i Yuan Gao. "Spanning-Tree Kernels on Graphs". W 2010 International Conference on Measuring Technology and Mechatronics Automation (ICMTMA 2010). IEEE, 2010. http://dx.doi.org/10.1109/icmtma.2010.69.
Pełny tekst źródłaLiu, Yi-Jiun, Well Y. Chou, James K. Lan i Chiuyuan Chen. "Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes". W 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.97.
Pełny tekst źródłaDay, Khaled, i Anand Tripathi. "Embedding Grids, Hypercubes, and Trees in Arrangement Graphs". W 1993 International Conference on Parallel Processing - ICPP'93 Vol3. IEEE, 1993. http://dx.doi.org/10.1109/icpp.1993.76.
Pełny tekst źródłaAzevedo, Marcelo Moraes de, Shahram Latifi i Nader Bagherzadeh. "On Packing and Embedding Hypercubes into Star Graphs". W Simpósio de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1994. http://dx.doi.org/10.5753/sbac-pad.1994.21873.
Pełny tekst źródłaSvonava, Daniel, i Michail Vlachos. "Visualizing Graphs Using Minimum Spanning Dendrograms". W 2010 IEEE 10th International Conference on Data Mining (ICDM). IEEE, 2010. http://dx.doi.org/10.1109/icdm.2010.71.
Pełny tekst źródłaRahmani, Mohammad Sohel, i Md Abul Kashem. "Degree restricted spanning trees of graphs". W the 2004 ACM symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/967900.967949.
Pełny tekst źródłaHuang, Silu, Ada Wai-Chee Fu i Ruifeng Liu. "Minimum Spanning Trees in Temporal Graphs". W SIGMOD/PODS'15: International Conference on Management of Data. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2723372.2723717.
Pełny tekst źródłaRaporty organizacyjne na temat "Spanning graphs of hypercubes"
Mahoney, James. Tree Graphs and Orthogonal Spanning Tree Decompositions. Portland State University Library, styczeń 2000. http://dx.doi.org/10.15760/etd.2939.
Pełny tekst źródła