Добірка наукової літератури з теми "Spanning graphs of hypercubes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Spanning graphs of hypercubes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Spanning graphs of hypercubes"
Kobeissi, Mohamed, and Michel Mollard. "Disjoint cycles and spanning graphs of hypercubes." Discrete Mathematics 288, no. 1-3 (November 2004): 73–87. http://dx.doi.org/10.1016/j.disc.2004.08.005.
Повний текст джерелаKobeissi, Mohamed, and Michel Mollard. "Spanning graphs of hypercubes: starlike and double starlike trees." Discrete Mathematics 244, no. 1-3 (February 2002): 231–39. http://dx.doi.org/10.1016/s0012-365x(01)00086-3.
Повний текст джерелаLIN, LAN, and YIXUN LIN. "The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids." Journal of Interconnection Networks 20, no. 01 (March 2020): 2050004. http://dx.doi.org/10.1142/s0219265920500048.
Повний текст джерелаRIORDAN, OLIVER. "Spanning Subgraphs of Random Graphs." Combinatorics, Probability and Computing 9, no. 2 (March 2000): 125–48. http://dx.doi.org/10.1017/s0963548399004150.
Повний текст джерелаYANG, JINN-SHYONG, JOU-MING CHANG, SHYUE-MING TANG, and YUE-LI WANG. "CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)." International Journal of Foundations of Computer Science 21, no. 01 (February 2010): 73–90. http://dx.doi.org/10.1142/s0129054110007143.
Повний текст джерелаTien, Jenn-Yang, and Wei-Pang Yang. "Hierarchical spanning trees and distributing on incomplete hypercubes." Parallel Computing 17, no. 12 (December 1991): 1343–60. http://dx.doi.org/10.1016/s0167-8191(05)80002-x.
Повний текст джерелаPai, Kung-Jui. "Dual Protection Routing Trees on Graphs." Mathematics 11, no. 14 (July 24, 2023): 3255. http://dx.doi.org/10.3390/math11143255.
Повний текст джерелаYang, Jinn-Shyong, Shyue-Ming Tang, Jou-Ming Chang, and Yue-Li Wang. "Parallel construction of optimal independent spanning trees on hypercubes." Parallel Computing 33, no. 1 (February 2007): 73–79. http://dx.doi.org/10.1016/j.parco.2006.12.001.
Повний текст джерелаNieminen, Juhani, Matti Peltola, and Pasi Ruotsalainen. "On Graphs Like Hypercubes." Tsukuba Journal of Mathematics 32, no. 1 (June 2008): 37–48. http://dx.doi.org/10.21099/tkbjm/1496165191.
Повний текст джерелаLocke, Stephen C., and Richard Stong. "Spanning Cycles in Hypercubes: 10892." American Mathematical Monthly 110, no. 5 (May 2003): 440. http://dx.doi.org/10.2307/3647840.
Повний текст джерелаДисертації з теми "Spanning graphs of hypercubes"
Kobeissi, Mohamed. "Plongement de graphes dans l'hypercube." Phd thesis, Grenoble 1, 2001. https://theses.hal.science/tel-00004683.
Повний текст джерелаVasquez, Maria Rosario. "An investigation of super line graphs of hypercubes." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865951.
Повний текст джерелаDepartment 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.
Повний текст джерелаKnox, Fiachra. "Embedding spanning structures in graphs and hypergraphs." Thesis, University of Birmingham, 2013. http://etheses.bham.ac.uk//id/eprint/4027/.
Повний текст джерелаMahoney, James Raymond. "Tree Graphs and Orthogonal Spanning Tree Decompositions." PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/2944.
Повний текст джерелаCairncross, Emily. "Proper 3-colorings of cycles and hypercubes." Oberlin College Honors Theses / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1621606265779497.
Повний текст джерелаWong, Wiseley. "Spanning trees, toughness, and eigenvalues of regular graphs." Thesis, University of Delaware, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3595000.
Повний текст джерелаSpectral 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.
Повний текст джерелаZhang, 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.
Повний текст джерелаKoo, Cheng Wai. "A Bound on the Number of Spanning Trees in Bipartite Graphs." Scholarship @ Claremont, 2016. https://scholarship.claremont.edu/hmc_theses/73.
Повний текст джерелаКниги з теми "Spanning graphs of hypercubes"
Deza. Scale-isometric polytopal graphs in hypercubes and cubic lattices: Polytopes in hypercubes and Zn̳. London: Imperial College Press, 2004.
Знайти повний текст джерелаGrishukhin, Viacheslav, Mikhail I. Shtogrin, and Michel-Marie Deza. Scale-Isometric Polytopal Graphs in Hypercubes and Cubic Lattices: Polytopes in Hypercubes and Zn. Imperial College Press, 2004.
Знайти повний текст джерелаSpanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach. World Scientific Publishing Co Pte Ltd, 2014.
Знайти повний текст джерелаЧастини книг з теми "Spanning graphs of hypercubes"
Jungnickel, Dieter. "Spanning Trees." In Graphs, Networks and Algorithms, 99–127. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03822-2_4.
Повний текст джерелаJungnickel, Dieter. "Spanning Trees." In Graphs, Networks and Algorithms, 103–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32278-5_4.
Повний текст джерелаHo, Ching-Tien. "Spanning Trees and Communication Primitives on Hypercubes." In 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.
Повний текст джерелаAkitaya, Hugo A., Maarten Löffler, and Csaba D. Tóth. "Multi-colored Spanning Graphs." In Lecture Notes in Computer Science, 81–93. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50106-2_7.
Повний текст джерелаDeza, Michel Marie, and Monique Laurent. "Isometric Embeddings of Graphs into Hypercubes." In Algorithms and Combinatorics, 283–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-04295-9_19.
Повний текст джерелаInoue, Keisuke, and Takao Nishizeki. "Spanning Distribution Forests of Graphs." In Frontiers in Algorithmics, 117–27. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08016-1_11.
Повний текст джерелаKawabata, Masaki, and Takao Nishizeki. "Spanning Distribution Trees of Graphs." In 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.
Повний текст джерелаBaumslag, M., M. C. Heydemann, J. Opatrny, and D. Sotteau. "Embeddings of shuffle-like graphs in hypercubes." In 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.
Повний текст джерелаKano, Mikio, Tomoki Yamashita, and Zheng Yan. "Spanning Caterpillars Having at Most k Leaves." In Computational Geometry and Graphs, 95–100. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45281-9_9.
Повний текст джерелаHeun, Volker, and Ernst W. Mayr. "Embedding graphs with bounded treewidth into optimal hypercubes." In STACS 96, 155–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-60922-9_14.
Повний текст джерелаТези доповідей конференцій з теми "Spanning graphs of hypercubes"
Qian, Yu, Baolei Cheng, Jianxi Fan, Yifeng Wang, and Ruofan Jiang. "Edge-disjoint spanning trees in the line graph of hypercubes." In 2021 IEEE 32nd International Conference on Application-specific Systems, Architectures and Processors (ASAP). IEEE, 2021. http://dx.doi.org/10.1109/asap52443.2021.00017.
Повний текст джерелаYang, Jinn-Shyong, Jou-Ming Chang, and HungChang Chan. "Independent Spanning Trees on Folded Hypercubes." In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.55.
Повний текст джерелаAl-Tawil, Khalid, and Dimiter Avresky. "Reconfiguration of Spanning Trees in Faulty Hypercubes." In 1994 International Conference on Parallel Processing (ICPP'94). IEEE, 1994. http://dx.doi.org/10.1109/icpp.1994.173.
Повний текст джерелаJiang, Qiang-rong, and Yuan Gao. "Spanning-Tree Kernels on Graphs." In 2010 International Conference on Measuring Technology and Mechatronics Automation (ICMTMA 2010). IEEE, 2010. http://dx.doi.org/10.1109/icmtma.2010.69.
Повний текст джерелаLiu, Yi-Jiun, Well Y. Chou, James K. Lan, and Chiuyuan Chen. "Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes." In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.97.
Повний текст джерелаDay, Khaled, and Anand Tripathi. "Embedding Grids, Hypercubes, and Trees in Arrangement Graphs." In 1993 International Conference on Parallel Processing - ICPP'93 Vol3. IEEE, 1993. http://dx.doi.org/10.1109/icpp.1993.76.
Повний текст джерелаAzevedo, Marcelo Moraes de, Shahram Latifi, and Nader Bagherzadeh. "On Packing and Embedding Hypercubes into Star Graphs." In 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.
Повний текст джерелаSvonava, Daniel, and Michail Vlachos. "Visualizing Graphs Using Minimum Spanning Dendrograms." In 2010 IEEE 10th International Conference on Data Mining (ICDM). IEEE, 2010. http://dx.doi.org/10.1109/icdm.2010.71.
Повний текст джерелаRahmani, Mohammad Sohel, and Md Abul Kashem. "Degree restricted spanning trees of graphs." In the 2004 ACM symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/967900.967949.
Повний текст джерелаHuang, Silu, Ada Wai-Chee Fu, and Ruifeng Liu. "Minimum Spanning Trees in Temporal Graphs." In SIGMOD/PODS'15: International Conference on Management of Data. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2723372.2723717.
Повний текст джерелаЗвіти організацій з теми "Spanning graphs of hypercubes"
Mahoney, James. Tree Graphs and Orthogonal Spanning Tree Decompositions. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.2939.
Повний текст джерела