- Bibliography
- More Referencing guides Blog Automated transliteration Relevant bibliographies by topics
- Automated transliteration
- Relevant bibliographies by topics
- Referencing guides
Dissertations / Theses on the topic 'Graph theory'
Create a spot-on reference in apa, mla, chicago, harvard, and other styles.
Consult the top 50 dissertations / theses for your research on the topic 'Graph theory.'
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.
Bessy, Stéphane. "Some problems in graph theory and graphs algorithmic theory." Habilitation à diriger des recherches, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00806716.
Myers, Joseph Samuel. "Extremal theory of graph minors and directed graphs." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619614.
Johnson, Chase R. "Molecular Graph Theory." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-theses/1179.
Feghali, Carl. "Topics in graph colouring and extremal graph theory." Thesis, Durham University, 2016. http://etheses.dur.ac.uk/11790/.
Nikwigize, Adolphe. "Graph theory : Route problems." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-17397.
Berg, Deborah. "Connections Between Voting Theory and Graph Theory." Scholarship @ Claremont, 2005. https://scholarship.claremont.edu/hmc_theses/178.
Hatt, Justin Dale. "Online assessment of graph theory." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/13389.
Keevash, Peter. "Topics in extremal graph theory." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619938.
Law, Ka-ho, and 羅家豪. "Some results in graph theory." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44899816.
Morrison, Julie Lindsay. "Computational graph theory in bioinformatics." Thesis, University of Strathclyde, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435114.
Richer, Duncan Christopher. "Graph theory and combinatorial games." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621916.
Eggemann, Nicole. "Some applications of graph theory." Thesis, Brunel University, 2009. http://bura.brunel.ac.uk/handle/2438/3953.
Nieh, Ari. "Fractional Analogues in Graph Theory." Scholarship @ Claremont, 2001. https://scholarship.claremont.edu/hmc_theses/131.
Reed, Bruce. "A semi-strong perfect graph theorem /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=72812.
Letzter, Shoham. "Extremal graph theory with emphasis on Ramsey theory." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709415.
Meek, Darrin Leigh. "On graph approximation heuristics : an application to vertex cover on planar graphs." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24088.
Zuffi, Lorenzo. "Simplicial Complexes From Graphs Toward Graph Persistence." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13519/.
Anderson, Jon K. "Genetic algorithms applied to graph theory." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136714.
Peng, Richard. "Algorithm Design Using Spectral Graph Theory." Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/277.
Islam, Mustafa R. "A hypertext graph theory reference system." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879844.
Edwards, C. S. "Some extremal problems in graph theory." Thesis, University of Reading, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373467.
Garbe, Frederik. "Extremal graph theory via structural analysis." Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8869/.
Grinshpun, Andrey Vadim. "Some problems in Graph Ramsey Theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97767.
Pappone, Francesco. "Graph neural networks: theory and applications." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23893/.
Parks, David J. "Graph theory in America, 1876-1950." Thesis, Open University, 2012. http://oro.open.ac.uk/54663/.
Schuerger, Houston S. "Contributions to Geometry and Graph Theory." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1707341/.
Weaver, Robert Wooddell. "Some problems in structural graph theory /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487268021746449.
Florkowski, Stanley F. "Spectral graph theory of the Hypercube." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://edocs.nps.edu/npspubs/scholarly/theses/2008/Dec/08Dec%5FFlorkowski.pdf.
Han, Lin. "Graph generative models from information theory." Thesis, University of York, 2012. http://etheses.whiterose.ac.uk/3726/.
Robinson, Laura Ann. "Graph Theory for the Middle School." Digital Commons @ East Tennessee State University, 2006. https://dc.etsu.edu/etd/2226.
Loveland, Susan M. "The Reconstruction Conjecture in Graph Theory." DigitalCommons@USU, 1985. https://digitalcommons.usu.edu/etd/7022.
Yi, Peipei. "Graph query autocompletion." HKBU Institutional Repository, 2018. https://repository.hkbu.edu.hk/etd_oa/557.
Hegde, Rajneesh. "New Tools and Results in Graph Structure Theory." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10481.
Lopez, Christian P. "On the relationship between a graph and the cycle graph of its complement." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1995. https://ro.ecu.edu.au/theses/1184.
Morisi, Rita. "Graph–based techniques and spectral graph theory in control and machine learning." Thesis, IMT Alti Studi Lucca, 2016. http://e-theses.imtlucca.it/188/1/Morisi_phdthesis.pdf.
Hoang, Chinh T. "Perfect graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74011.
Hayward, Ryan B. "Two classes of perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74025.
Olariu, Stephan. "Results on perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=73997.
Waterhouse, Mary Alexandra Paula Royston Hastilow. "Coloured graph decompositions /." [St. Lucia, Qld.], 2005. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18769.pdf.
Weinstein, Lee. "Empirical study of graph properties with particular interest towards random graphs." Diss., Connect to the thesis, 2005. http://hdl.handle.net/10066/1485.
Narayanan, Bhargav. "Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/252850.
Fiala, Nick C. "Some topics in combinatorial design theory and algebraic graph theory /." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486402957198077.
Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.
Turner, Bethany. "Embeddings of Product Graphs Where One Factor is a Hypercube." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2455.
Srikanthan, T. "Bond graph analysis." Thesis, Coventry University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373896.
Chen, Xujin, and 陳旭瑾. "Graph partitions and integer flows." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30286256.
Vella, Antoine. "A Fundamentally Topological Perspective on Graph Theory." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1033.
Douma, Femke. "Counting and averaging problems in graph theory." Thesis, Durham University, 2010. http://etheses.dur.ac.uk/272/.
Al-Shimary, Abbas. "Applications of graph theory to quantum computation." Thesis, University of Leeds, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608359.
Yilma, Zelealem Belaineh. "Results in Extremal Graph and Hypergraph Theory." Research Showcase @ CMU, 2011. http://repository.cmu.edu/dissertations/49.
Doctoral Thesis
Joan Vilaltella. Contributions to the theory of graph edge-coloring: snarks and multipoles. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 2015
Aida Abiad. Spectral characterizations of graphs. Doctoral Thesis, Univ. Tilburg, Tilburg, The Netherlands, 2015.
Guillem Perarnau. Random combinatorial structures with low dependencies: existence and enumeration . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Oct. 2013.
Julián Salas . On the Structure of Graphs without Short cycles. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Dec. 2012.
Lluís Vena. The removal Lemma: algebraic versions and applications . Doctoral Thesis, Univ. Politècnica de Catalunya, Jul. 2012.
Luis Pedro Montejano . Restricted Connectivity in Families of Graphs . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Set. 2011.
Marc Càmara . Algebraic and Combinatoric Approach to Pseudo-distance Regularity and Completely Pseudo-regular Codes . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jun. 2011.
Jordi Moragas . Graph Labelings and Decompositions by Partitioning Sets of Integers . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jun. 2010.
Diego González . Fault Tolerance Results for Some Families of Graphs . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Nov. 2009.
Ignasi Sau . Optimization of Graphs under Degree Constraints: Application to Telecommunication Networks . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Oct. 2009.
Amanda Montejano . Colored Combinatorial Structures: Homomorphisms and Counting . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jun. 2009.
Cristina Dalfó . Estudi i Disseny de Grans Xarxes d'Interconnexió: Modularitat i Comunicació . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Des. 2007.
Javier Barajas. Coloring Problems in Cayley Graphs . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jun. 2007.
Silvia Gago. Métodos espectrales y nuevas medidas, modelos y parámetros en grafos pequeño-mundo invariantes de escala . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 2006.
Christian Barrientos. Difference Graph Labelings. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 2004.
Eduardo Canale. Estudio y construcción de estructuras topológicas idóneas para la modelización de redes de interconexión. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Abr. 2003.
Xavier Marcote. Some Contributions to the Study of the Connectedness of Graphs and Digraphs. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Abr. 2003.
Susana C. López Masip. Descomposicions de grafs en arbres . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Feb. 2003.
Francesc A. Muntaner. Magic Graphs . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Nov. 2001.
Javier Ozón. Contribución al coloreado de grafos y las redes pequeño-mundo . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 2001.
Sonia Pérez. Recubrimientos k-arco transitivos de digrafos . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Feb. 2001.
Montserrat Maureso. Digrafs sobre grups abelians finits: anàlisi dels digrafs endo-circulants. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jun. 2000.
Iñaki Pelayo. Some contributions from Graph Theory to the design and study of Large and Fault-tolerant Interconnection Networks . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Abr. 2000.
Joan Gimbert. Aplicacions de la Teoria Espectral a l'Estudi dels Digrafs Densos. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Abr. 2000.
Amauri Gutiérrez. Descomposiciones de grafos regulares. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Feb. 2000.
Lali Barrière. Anells cordals: propietats estructurals i models de comunicacions. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Oct. 1999.
Daniela Ferrero. Graphs and hypergraphs as interconnection network models. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 1999.
Margarida Mitjana. Propagació d'informació en grafs i digrafs que modelen xarxes d'interconnexió simètriques. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Mar. 1999.
Ernest Garriga. Contribució a la Teoria Espectral de Grafs.Problemes mètrics i distància-regularitat . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Dec. 1997.
Juan Alberto Rodríguez. Cotas de Diversos Parámetros de un Grafo a partir de los Autovalores de su Matriz Laplaciana. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 1997.
Xavier Muñoz. Digrafs linia. Alguns aspectes en comunicacions. (Broadcasting i vulnerabilitat) . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Des. 1996.
Camino Balbuena. Estudio sobre algunas nuevas clases de conectividad condicional en grafos dirigidos . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Nov. 1995.
Angeles Carmona. Grafos y digrafos con máxima conectividad y máxima distancia conectividad . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Nov. 1995.
E. Simó. Vulnerabilidad del diámetro de ciertas familias de grafos . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Jul. 1995.
M. Espona. Xarxes de Permutacions i Digrafs Acolorits: Anàlisi i Disseny. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Dec. 1994.
J. Gómez. Contribución a la Teoria de Grafos Densos. Doctoral Thesis, Univ. Autònoma de Barcelona, Barcelona, 1994.
J.M. Brunat. Contribució a l'estudi de la simetria de grafs dirigits i les seves aplicacions . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Oct. 1994.
J.L. Villar. Contribución a la Teoría de Redes con Enlaces Bidireccionales Derivadas de los Digrafos L\' \i nea . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Nov. 1994.
M. Zaragozà. Redes de Interconexión: Contribución al Estudio de su Vulnerabilidad . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1994.
F. Aguiló. Caracterització i Disseny de les Xarxes d'Interconnexió de Doble Llaç Óptimes . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1994.
Carles Padró. Vulnerabilitat en Famílies Óptimes de Digrafs per al Disseny de Xarxes d'Interconnexió . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1994.
F. Hurtado. Problemas de Visibilidad Geomètrica . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1993.
A. S. Lladó. Contribució a l'Estudi i al Diseny de Xarxes d'Interconexió amb Enllaços Unidireccionals . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1989.
M. Mora. Digrafs c-Circulants com a Model per a Xarxes d'Interconnexió . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1988.
O. Serra. Models Algèbrics per a Emmagatzament de Dades . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1988.
P. Morillo. Grafos y Digrafos Asociados con Teselaciones como Modelos para Redes de Interconexión . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1987.
M. Escudero. Contribución al Estudio de Redes Modeladas por Grafos sobre Alfabeto . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1987.
J. Gómez. Diámetro y Vulnerabilidad en Redes de Interconexión . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1986.
J. Fàbrega. Grafos y Redes de Interconexión: Diseño, Fiabilidad y Encaminamiento. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Sep. 1984.
M.A. Fiol. Aplicaciones de la Teoria de Grafos al Diseño de Redes de Interconexión de Multiprocesadores . Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, 1982.
We are looking to recruit a
Master thesis or internship - graph partitioning in power system studies.
At the Institute of Energy and Climate Research - Energy Systems Engineering (IEK-10) we focus on the optimal design and operation of integrated, decentralized energy systems with a high share of renewable energy. Computer simulation and numerical optimization are our essential tools to arrive at efficient, reliable and cost-effective solutions. We contribute both to the development of mathematical models and to the development of improved simulation methods and optimization algorithms. Our methods and software-tools are validated against operating data of real systems. Furthermore, we conduct comprehensive case studies in order to test and further improve the scalability and the performance of our models and algorithms. Specially adapted methods and codes enable us to exploit the potential of high performance computing with the aim of solving particularly large and complex problems.
- Review of (classical) partitioning algorithms, e.g. spectral methods based on Network Modularity
- Identification of use cases for graph partitioning in power systems related studies, e.g. for State Estimation
- Develope new or tailor existing QUBO (Quadratic Unconstrianed Binary Optimization) formulations for graph partitioning objecitves to the use case found in step
- Compare the partitioning found using the classical algorithms (from 1) with Quantum Optimization Ansatz (from 3)
Your Profile:
- Enrolled as master student in a university
- Good background in physics, electrical engineering, computer science, mathematics or other related subject (you do not need a background in Quantum Computation/Optimization)
- Good programming skills
- Useful expertise for the project: Graph Theory/Network Science, Power Systems, Linear Algebra
We work on the very latest issues that impact our society and are offering you the chance to actively help in shaping the change! We support you in your work with:
- Interdisciplinary work combining physics, mathematics, computer science, and engineering
- Intensive supervision by one or more experienced and helpful colleague(s)
- Friendly and international working environment
- Access to high-performance computing hardware, and chances to run your algorithm on state-of-the-art quantum-computers and/or supercomputers
- An interesting and socially relevant topic for your thesis with a forward-looking theme
- The chance to independently prepare and work on your tasks
- A large research campus with green spaces, offering the best possible means for networking with colleagues and pursuing sports alongside work
In addition to exciting tasks and a collaborative working atmosphere at Jülich, we have a lot more to offer: https://go.fzj.de/benefits We welcome applications from people with diverse backgrounds, e.g. in terms of age, gender, disability, sexual orientation / identity, and social, ethnic and religious origin. A diverse and inclusive working environment with equal opportunities in which everyone can realize their potential is important to us.
We look forward to receiving your application. The job will be advertised until the position has been successfully filled. You should therefore submit your application as soon as possible.
Questions about the offer.
Please feel free to contact us via our contact form. Please note that for technical reasons we cannot accept applications by e-mail.
You can find helpful information on the application and selection process here . You can also find answers to frequently asked questions in our FAQs .
IMAGES
VIDEO
COMMENTS
This thesis is the result of research between January 2002 and February 2005 in three topics of graph theory, namely: spanning 2-connected subgraphs of some classes of grid graphs, Ramsey numbers for paths versus other graphs, and λ-backbone colorings. The papers that together underlay this thesis are listed below. Publications in refereed ...
in exploring new areas of graph theory and its applications. Ad-vanced students in graph theory may use the topics presented in this book to develop their nal-year projects, master's theses or doctoral dissertations. It is the author's hope that this publication of original re-search ideas, problems and conjectures will instigate further re-xi
Distance measures for graph theory : Comparisons and analyzes of different methods Dissertation presented by Maxime DUYCK for obtaining the Master's degree in Mathematical Engineering Supervisor(s) ... his advice and his precious help throughout the realization of this thesis. Second, I would also like to thank Bertrand Lebichot and Guillaume ...
I declare that the master thesis entitled "A Study of Graph Theory With Matrix Representation" is my own work, and hereby certify that unless stated, all work contained within this thesis is my own independent research and has not been submitted for the award of any other degree at any institution, ex-cept where due acknowledgment is made in ...
Master's Thesis Application of Graph Neural Networks and graph descriptors ... In this thesis, we explore multiple approaches to graph classification. We focus on Graph Neural ... Graph theory, pioneered by Euler in the 18th century, has very strong mathematical foundations. A multitude of practical applications, com-
Namely, it is shown in Section 4.2.1 that the line graph of the Petersen graph is a generalized Cayley graph (see Example 4.2.2), and it is well-known that this graph is vertex-transitive but not Cayley graph. Besides the line graph of the Petersen graph, two in nite families of generalized Cayley graphs which are vertex-transitive
Master of Science. The program of graduated studies. Department of mathematics. Deanship of Graduate Studies and Scientific Researc h. A Study of Graph Theory With Matrix Representation. Prepared ...
L(2,1)-labelling on a planar graph was proposed during a stay at INRIA in Nice. The work on the clustering coefficient was mainly carried out at Brunel University. Two chapters of this thesis are dedicated to the investigation of properties of scale-free graphs. These are graphs which have a degree distribution obey-
In the thesis we study two topics in graph theory. The first one is concerned with the famous conjecture of Hadwiger that every graph G without a minor of a complete graph on t +1 vertices can be coloured with t colours. We investigate how large an induced subgraph of G can be, so that the subgraph can be coloured with t colours.
thesis requirement for the degree of Master of Mathematics in Combinatorics and Optimization Waterloo, Ontario, Canada, 2015 c Alexis Hunt 2015. ... The intersection of these elds and graph theory is a growing area of study. Engelfriet and Courcelle recently published a book [2] outlining many major results from their work in the area, and ...
Graph Theoretical Modelling of Electrical Distribution Grids Iris Kohler This thesis deals with the applications of graph theory towards the electrical distribution networks that transmit electricity from the generators that produce it and the consumers that use it. Speci cally, we establish the substation and bus network as graph theoretical
Graph Theory for the Secondary School Classroom. A thesis presented to the faculty of the Department of Mathematics East Tennessee State University. In partial fulfillment of the requirements for the degree Master of Science in Mathematical Sciences. by Dayna Brown Smithers May 2005.
APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND GRAPH THEORY TO CYBERBULLYING By Jesse D Simpson A Master's Thesis Submitted to the Graduate College Of Missouri State University In Partial Fulfillment of the Requirements For the Degree of Master of Science, Computer Science August 2020 Approved: Jamil M. Saquer, Ph.D., Thesis Committee Chair
an example. A complete graph, denoted Kn, is a simple graph with n vertices such that any two distinct vertices are adjacent. A complete bipartite graph is a bipartite graph, G[X,Y], in which each x in X is adjacent to every y in Y. As noted in [6], since the usual graph colorings are special cases of list colorings, we have
Study and optimization of production flow by applying a graph theory approach. Executive Summary The main objective of this thesis is to develop and perform an analysis of optimization based on applying a Graph Theory approach on manufacturing systems, throughout which fundamental information about the structure and connectivity behaviour of the
ourishing area of graph theory. O. Ore and C. Berge intro-duced the concept of domination. In his book called Theory of graphs [38] O. Ore used the terms dominating sets and domination number for the rst time. A detailed survey on domination can be found in [28] and [29]. Another important concern of research in graph theory is graph polynomials.
Using concepts of Graph Theory this masters project examines the underlying structures of two specific families of compounds, fullerenes and zeolites, from a chemical and mathematical perspective. ... Schuerger, Houston S. "Contributions to Geometry and Graph Theory." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark ...
Abstract: This paper describes the process of planning the realization stages of a research thesis. (license/master) and classical method s of graph theory are applied to the proposed ones. It is ...
Some Topological Concepts Via Graph Theory Taha H. Jasim 1 , Aiad I. Awad 2 1 Department of Mathematics, College of Comp uter Science and Mathematics, Tikrit University , Tik rit , Iraq
Master Thesis Jul 2015 On-line graph coloring with random adversary ... Nov 2011 Some applications of linear algebra in Spectral Graph Theory Aida Abiad Advisor: Fiol Mora, Miquel Angel Jun 2011 The Thompson group and the 4-colour theorem Eric López Advisor: Burillo Puig, Josep and Serra Albó, Oriol
Abstract : The content of the thesis is divided into two parts; graph theory and linear programming. The main results in the first part concerns extremal graph theory. Here we want to determine the number of edges in a graph needed to ensure the existence of certain local structures. READ MORE.
Some contributions from Graph Theory to the design and study of Large and Fault-tolerant Interconnection Networks. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Abr. 2000. Joan Gimbert. Aplicacions de la Teoria Espectral a l'Estudi dels Digrafs Densos. Doctoral Thesis, Univ. Politècnica de Catalunya, Barcelona, Abr. 2000.
Outstanding Master's Thesis 26 Outstanding Final Project 30 Outstanding Publication 49 ... Nate is very strong in the theory and fundamental studies and ... learn Graph databases, Cypher query languages, training ChatGPT using prompts etc. She was able to quickly adapt and pickup these new skills,
Theory of the strong interactions (IKP-3 / IAS-4) ... Master Thesis or Internship - Graph Partitioning in Power System Studies. At the Institute of Energy and Climate Research - Energy Systems Engineering (IEK-10) we focus on the optimal design and operation of integrated, decentralized energy systems with a high share of renewable energy. ...