Dissertations / Theses on the topic 'Subdivision of Star graph'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 47 dissertations / theses for your research on the topic 'Subdivision of Star graph.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Jackson, Penelope S. "Star sets and related aspects of algebraic graph theory." Thesis, University of Stirling, 1999. http://hdl.handle.net/1893/26690.
Full textKosebinu, Kazeem A. "Partially Oriented 6-star Decomposition of Some Complete Mixed Graphs." Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/etd/3943.
Full textAnzur, Matthew Paul. "k-star decomposition of lambda-fold complete multipartite graphs." Auburn, Ala., 2007. http://repo.lib.auburn.edu/07M%20Dissertations/ANZUR_MATTHEW_39.pdf.
Full textMelinder, Victor. "Upper bounds on the star chromatic index for bipartite graphs." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-164938.
Full textCoutinho, Bruno Gabriel Coelho. "Kuramoto model aplicado a um star graph e a redes scale-free." Master's thesis, Universidade de Aveiro, 2011. http://hdl.handle.net/10773/9669.
Full textTarhini, Batoul. "Oriented paths in digraphs and the S-packing coloring of subcubic graph." Electronic Thesis or Diss., Bourgogne Franche-Comté, 2023. http://www.theses.fr/2023UBFCK079.
Full textDerakhshan, Parisa. "Automorphisms generating disjoint Hamilton cycles in star graphs." Thesis, Loughborough University, 2015. https://dspace.lboro.ac.uk/2134/16779.
Full textCulver, Chance. "Decompositions of the Complete Mixed Graph by Mixed Stars." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/etd/3782.
Full textCulver, Chance. "Decompositions of the Complete Mixed Graph by Mixed Stars." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/3782.
Full textMoura, Phablo Fernando Soares. "Graph colorings and digraph subdivisions." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/.
Full textNeggazi, Brahim. "Self-stabilizing algorithms for graph parameters." Thesis, Lyon 1, 2015. http://www.theses.fr/2015LYO10041/document.
Full textMalloy, Nicole Andrea. "Minimum Rank Problems for Cographs." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3873.
Full textStewart, Craig R. "An Evolutionary Analysis of the Internet Autonomous System Network." Kent State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=kent1276550359.
Full textBahalkeh, Esmaeil. "Efficient Algorithms for Calculating the System Matrix and the Kleene Star Operator for Systems Defined by Directed Acyclic Graphs over Dioids." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1440116216.
Full textMortada, Maidoun. "The b-chromatic number of regular graphs." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10116.
Full textSehovic, Mirsad, and Markus Carlsson. "Nåbarhetstestning i en baneditor : En undersökning i hur nåbarhetstester kan implementeras i en baneditor samt funktionens potential i att ersätta manuell testning." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-36394.
Full textChen, Min. "Vertex coloring of graphs via the discharging method." Thesis, Bordeaux 1, 2010. http://www.theses.fr/2010BOR14090/document.
Full textBína, Vladislav. "Mnoharozměrná pravděpodobnostní rozdělení: Struktura a učení." Doctoral thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-72677.
Full textGulshan, Varun. "From interactive to semantic image segmentation." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:706b648a-e5e7-4334-a456-0f0b5701dbc4.
Full textBraz, Caio de Moraes. "Segmentação de imagens pela transformada imagem-floresta com faixa de restrição geodésica." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-01062016-104354/.
Full textGhazal, Salman. "Étude de la conjecture de Seymour sur le second voisinage." Phd thesis, Université Claude Bernard - Lyon I, 2011. http://tel.archives-ouvertes.fr/tel-00744560.
Full textMansilla, Lucy Alsina Choque. "Transformada imagem-floresta com funções de conexidade não suaves: pesos adaptativos, polaridade de borda e restrições de forma." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-17032014-121734/.
Full textHsu, Hong-Chun, and 許弘駿. "Hamiltonian Properties of Star Graph Families." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/79351246812601427064.
Full textLiu, Chiu-chu, and 劉秋祝. "Multicast Algorithms on Star Graph Interconnection Networks." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/77474808682863242184.
Full textChiang, Jian-An, and 蔣健安. "A Study on the Star Graph Interconnection Network." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/58731181204446512787.
Full textLIAO, WEN-HUA, and 廖文華. "A broadcasting algorithm in star graph interconnection networks." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/80777545007283753549.
Full textLiu, Tung-Hsing, and 劉東興. "Wormhole Routing on the Star Graph Interconnection Network." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/74847907055683477565.
Full textChu, Ching, and 朱慶. "On the Diameter of the Unidirectional Star Graph." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/33680652706047949648.
Full textWang, Nen-Chung, and 王能中. "Multicast Algorithms in Wormhole-Routed Star Graph Interconnection Networks." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/85715218751750231055.
Full textTseng, Chun-Hong, and 曾俊宏. "Routing Algorithm and Diameter for the Unidirectional Star Graph." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/53816271994933707171.
Full textLin, Chang Wu, and 章戊霖. "Efficient Broadcasting Algorithms in the Star Graph Interconnection Networks." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/51938031584022053844.
Full textTai, Keng-Sheng, and 戴耿聖. "Near-Optimal Broadcasting in a (n, k)-Star Graph." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/67460217179859379485.
Full textPan, PoSheng, and 潘伯陞. "Diagnosis Algorithm on the Star Graph under the PMC Model." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/20703187588653568641.
Full textLI, ZHEN-MING, and 李振銘. "All-to-all broadcasting algorithms on star graph interconnection network." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/37465524589124043904.
Full textTian-shiang, Harng, and 韓天祥. "Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/94861670093012184391.
Full textWang, Neng-Chung, and 王能中. "Efficient Multicasting Strategies on Wormhole-Routed Star Graph and Irregular Networks." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/zz967r.
Full textShyan, Chen Yuh, and 陳裕賢. "Algorithm-Based Fault-Tolerant Strategies in Faulty Hypercube and Star Graph Multicomputers." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/52093418085298365197.
Full textHsieh, Yi-Lin, and 謝易霖. "Fault Hamiltonicity and fault Hamiltonian connectivity of The (n, k)-star graph." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/56349980942541777977.
Full textChang, Chin-Hua, and 張晉華. "A Study of Fault-Tolerant Routing on Star Graph Using Limited- Global-Information." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/47163772362489807277.
Full textRen, Shi Min, and 任世敏. "Efficient all-to-all broadcasting in the hypercube and star graph interconnection networks." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/98189246772016886186.
Full textDu, Ming Zhi, and 杜明智. "A study of multicast problem in the hypercube and star graph interconnection networks." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/45557925820224954814.
Full textChiu, Chiao-Wei, and 邱喬偉. "A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/u99jrh.
Full textWei-HaoDeng and 鄧偉豪. "Topological Properties and Conditional Diagnosability of(n,k)-star Graph Under the Comparison Diagnosis Model." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/95873051168710359375.
Full textHon, Min Hor, and 洪明豪. "Algorithms for Finding Vertex-disjoint Paths and Edge-disjoint Spanning Trees in Star Graph Interconnection Networks Work Management System." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/47729401399593481665.
Full textXu, Zhi. "The Frobenius Problem in a Free Monoid." Thesis, 2009. http://hdl.handle.net/10012/4574.
Full textMelka, Jakub. "Výpočetní složitost v teorii grafů." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-379578.
Full textPacheco, Maria de Fátima Moreira da Silva. "Recognition of graphs with convex quadratic stability number." Doctoral thesis, 2019. http://hdl.handle.net/10773/29883.
Full text