Дисертації з теми "THEORY OF SIGNED GRAPHS"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "THEORY OF SIGNED GRAPHS".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Bowlin, Garry. "Maximum frustration of bipartite signed graphs." Diss., Online access via UMI:, 2009.
Знайти повний текст джерелаWang, Jue. "Algebraic structures of signed graphs /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20WANG.
Повний текст джерелаSen, Sagnik. "A contribution to the theory of graph homomorphisms and colorings." Phd thesis, Bordeaux, 2014. http://tel.archives-ouvertes.fr/tel-00960893.
Повний текст джерелаSivaraman, Vaidyanathan. "Some Topics concerning Graphs, Signed Graphs and Matroids." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035.
Повний текст джерелаSun, Qiang. "A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS109/document.
Повний текст джерелаIn this thesis, we study two main problems in graph theory: homomorphism problem of planar (signed) graphs and Hamiltonian cycle problem.As an extension of the Four-Color Theorem, it is conjectured ([80],[41]) that every planar consistent signed graph of unbalanced-girth d+1(d>1) admits a homomorphism to signed projective cube SPC(d) of dimension d. It is naturally asked that:Is SPC(d) an optimal bound of unbalanced-girth d+1 for all planar consistent signed graphs of unbalanced-girth d+1?In Chapter 2, we prove that: if (B,Ω) is a consistent signed graph of unbalanced-girth d which bounds the class of consistent signed planar graphs of unbalanced-girth d, then |B|≥2^{d-1}. Furthermore,if no subgraph of (B,Ω) bounds the same class, δ(B)≥d, and therefore,|E(B)|≥d·2^{d-2}.Our result shows that if the conjecture above holds, then the SPC(d) is an optimal bound both in terms of number of vertices and number of edges.When d=2k, the problem is equivalent to the homomorphisms of graphs: isPC(2k) an optimal bound of odd-girth 2k+1 for P_{2k+1}(the class of all planar graphs of odd-girth at least 2k+1)? Note that K_4-minor free graphs are planar graphs, is PC(2k) also an optimal bound of odd-girth 2k+1 for all K_4-minor free graphs of odd-girth 2k+1 ? The answer is negative, in [6], a family of graphs of order O(k^2) bounding the K_4-minor free graphs of odd-girth 2k+1 were given. Is this an optimal bound? In Chapter 3, we prove that: if B is a graph of odd-girth 2k+1 which bounds all the K_4-minor free graphs of odd-girth 2k+1,then |B|≥(k+1)(k+2)/2. Our result together with the result in [6] shows that order O(k^2) is optimal.Furthermore, if PC(2k) bounds P_{2k+1},then PC(2k) also bounds P_{2r+1}(r>k). However, in this case we believe that a proper subgraph of PC(2k) would suffice to bound P_{2r+1}, then what’s the optimal subgraph of PC(2k) that bounds P_{2r+1}? The first case of this problem which is not studied is k=3 and r=5. For this case, Naserasr [81] conjectured that the Coxeter graph bounds P_{11} . Supporting this conjecture, in Chapter 4, we prove that the Coxeter graph bounds P_{17}.In Chapter 5,6, we study the Hamiltonian cycle problems. Dirac showed in 1952that every graph of order n is Hamiltonian if any vertex is of degree at least n/2. This result started a new approach to develop sufficient conditions on degrees for a graph to be Hamiltonian. Many results have been obtained in generalization of Dirac’s theorem. In the results to strengthen Dirac’s theorem, there is an interesting research area: to control the placement of a set of vertices on a Hamiltonian cycle such that thesevertices have some certain distances among them on the Hamiltonian cycle.In this thesis, we consider two related conjectures, one is given by Enomoto: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G, there is a Hamiltonian cycle C of G such that dist_C(x, y)=n/2. Motivated by this conjecture, it is proved,in [32],that a pair of vertices are located at distances no more than n/6 on a Hamiltonian cycle. In [33], the cases δ(G) ≥(n+k)/2 are considered, it is proved that a pair of vertices can be located at any given distance from 2 to k on a Hamiltonian cycle. Moreover, Faudree and Li proposed a more general conjecture: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G andany integer 2≤k≤n/2, there is a Hamiltonian cycle C of G such that dist_C(x, y) = k. Using Regularity Lemma and Blow-up Lemma, in Chapter 5, we give a proof ofEnomoto’s conjecture for graphs of sufficiently large order, and in Chapter 6, we give a proof of Faudree and Li’s conjecture for graphs of sufficiently large order
Kotzagiannidis, Madeleine S. "From spline wavelet to sampling theory on circulant graphs and beyond : conceiving sparsity in graph signal processing." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/56614.
Повний текст джерелаLucas, Claire. "Trois essais sur les relations entre les invariants structuraux des graphes et le spectre du Laplacien sans signe." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00956183.
Повний текст джерелаMutar, Mohammed A. "Hamiltonicity in Bidirected Signed Graphs and Ramsey Signed Numbers." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1513377549200572.
Повний текст джерелаKang, Yingli [Verfasser]. "Coloring of signed graphs / Yingli Kang." Paderborn : Universitätsbibliothek, 2018. http://d-nb.info/1153824663/34.
Повний текст джерелаOmeroglu, Nurettin Burak. "K-way Partitioning Of Signed Bipartite Graphs." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614817/index.pdf.
Повний текст джерелаSchubert, Michael [Verfasser]. "Circular flows on signed graphs / Michael Schubert." Paderborn : Universitätsbibliothek, 2018. http://d-nb.info/1161798684/34.
Повний текст джерелаLe, Falher Géraud. "Characterizing edges in signed and vector-valued graphs." Thesis, Lille 1, 2018. http://www.theses.fr/2018LIL1I013/document.
Повний текст джерелаWe develop methods to efficiently and accurately characterize edges in complex networks. In simple graphs, nodes are connected by a single semantic. For instance, two users are friends in a social networks. Moreover, those connections are typically driven by node similarity, according to homophily. In the previous example, users become friends because of common features. By contrast, complex networks are graphs where every connection has one semantic among k possible ones. Those connections are moreover based on both partial homophily and heterophily of their endpoints. This additional information enable finer analysis of real world graphs. However, it can be expensive to acquire, or is sometimes not known beforehand. We address the problems of inferring edge semantics in various settings. First, we consider graphs where edges have two opposite semantics, and where we observe the label of some edges. These so-called signed graphs are a common way to represent polarized interactions. We propose two learning biases suited for directed and undirected signed graphs respectively. This leads us to design several algorithms leveraging the graph topology to solve a binary classification problem that we call edge sign prediction. Second, we consider graphs with k > 2 available semantics for edge. In that case of multilayer graphs, we are not provided with any edge label, but instead are given one feature vector for each node. Faced with such an unsupervised problem, we devise a quality criterion expressing how well an edge k-partition and k semantical vectors explains the observed connections. We optimize this goodness of explanation criterion in vectorial and matricial forms
Papalamprou, Konstantinos. "Structural and decomposition results for binet matrices, bidirected graphs and signed-graphic matroids." Thesis, London School of Economics and Political Science (University of London), 2009. http://etheses.lse.ac.uk/2193/.
Повний текст джерелаLamb, John D. "Theory of bond graphs." Thesis, University of Nottingham, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239418.
Повний текст джерелаBorinsky, Michael. "Graphs in perturbation theory." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19201.
Повний текст джерелаThis thesis provides an extension of the work of Dirk Kreimer and Alain Connes on the Hopf algebra structure of Feynman graphs and renormalization to general graphs. Additionally, an algebraic structure of the asymptotics of formal power series with factorial growth, which is compatible with the Hopf algebraic structure, will be introduced. The Hopf algebraic structure on graphs permits the explicit enumeration of graphs with constraints for the allowed subgraphs. In the case of Feynman diagrams a lattice structure, which will be introduced, exposes additional unique properties for physical quantum field theories. The differential ring of factorially divergent power series allows the extraction of asymptotic results of implicitly defined power series with vanishing radius of convergence. Together both structures provide an algebraic formulation of large graphs with constraints on the allowed subgraphs. These structures are motivated by and used to analyze renormalized zero-dimensional quantum field theory at high orders in perturbation theory. As a pure application of the Hopf algebra structure, an Hopf algebraic interpretation of the Legendre transformation in quantum field theory is given. The differential ring of factorially divergent power series will be used to solve two asymptotic counting problems in combinatorics: The asymptotic number of connected chord diagrams and the number of simple permutations. For both asymptotic solutions, all order asymptotic expansions are provided as generating functions in closed form. Both structures are combined in an application to zero-dimensional quantum field theory. Various quantities are explicitly given asymptotically in the zero-dimensional version of phi^3, phi^4, QED, quenched QED and Yukawa theory with their all order asymptotic expansions.
Badaoui, Mohamad. "G-graphs and Expander graphs." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMC207/document.
Повний текст джерелаApplying algebraic and combinatorics techniques to solve graph problems leads to the birthof algebraic and combinatorial graph theory. This thesis deals mainly with a crossroads questbetween the two theories, that is, the problem of constructing infinite families of expandergraphs.From a combinatorial point of view, expander graphs are sparse graphs that have strongconnectivity properties. Expanders constructions have found extensive applications in bothpure and applied mathematics. Although expanders exist in great abundance, yet their explicitconstructions, which are very desirable for applications, are in general a hard task. Mostconstructions use deep algebraic and combinatorial approaches. Following the huge amountof research published in this direction, mainly through Cayley graphs and the Zig-Zagproduct, we choose to investigate this problem from a new perspective; namely by usingG-graphs theory and spectral hypergraph theory as well as some other techniques. G-graphsare like Cayley graphs defined from groups, but they correspond to an alternative construction.The reason that stands behind our choice is first a notable identifiable link between thesetwo classes of graphs that we prove. This relation is employed significantly to get many newresults. Another reason is the general form of G-graphs, that gives us the intuition that theymust have in many cases such as the relatively high connectivity property.The adopted methodology in this thesis leads to the identification of various approaches forconstructing an infinite family of expander graphs. The effectiveness of our techniques isillustrated by presenting new infinite expander families of Cayley and G-graphs on certaingroups. Also, since expanders stand in no single stem of graph theory, this brings us toinvestigate several closely related threads from a new angle. For instance, we obtain newresults concerning the computation of spectra of certain Cayley and G-graphs, and theconstruction of several new infinite classes of integral and Hamiltonian Cayley graphs
Mighton, John 1957. "Knot theory on bipartite graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ49930.pdf.
Повний текст джерелаBackman, Spencer Christopher Foster. "Combinatorial divisor theory for graphs." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51908.
Повний текст джерелаHoang, Chinh T. "Perfect graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74011.
Повний текст джерелаMöller, Rögnvaldur G. "Groups acting on graphs." Thesis, University of Oxford, 1991. http://ora.ox.ac.uk/objects/uuid:2dacfc67-56c4-4541-b52e-10199a13dcc2.
Повний текст джерелаJagger, Christopher Neil. "Partitions of graphs." Thesis, University of Cambridge, 1995. https://www.repository.cam.ac.uk/handle/1810/251583.
Повний текст джерелаAl-Doujan, Fawwaz Awwad. "Spectra of graphs." Thesis, University of East Anglia, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306195.
Повний текст джерелаChan, Wai Hong. "Bandwidth problems of graphs." HKBU Institutional Repository, 1996. http://repository.hkbu.edu.hk/etd_ra/62.
Повний текст джерелаMacon, Lisa Fischer. "Almost regular graphs and edge-face colorings of plane graphs." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002507.
Повний текст джерелаPearce, Geoffrey. "Transitive decompositions of graphs." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0087.
Повний текст джерелаWojciechowska, Iwona. "Broadcasting in grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=877.
Повний текст джерелаTitle from document title page. Document formatted into pages; contains vii, 69 p. : ill. Includes abstract. Includes bibliographical references (p. 67-69).
Montgomery, Bruce Lee. "Dynamic coloring of graphs." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2109.
Повний текст джерелаTitle from document title page. Document formatted into pages; contains viii, 52 p. : ill. Vita. Includes abstract. Includes bibliographical references (p. 51).
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.
Повний текст джерелаSrinivasa, Christopher. "Graph Theory for the Discovery of Non-Parametric Audio Objects." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/20126.
Повний текст джерелаThwaites, Peter. "Chain event graphs : theory and application." Thesis, University of Warwick, 2008. http://wrap.warwick.ac.uk/49194/.
Повний текст джерелаWagner, Peter. "The Ramsey theory of multicoloured graphs." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614225.
Повний текст джерелаJonsson, Jakob. "Simplicial complexes of graphs /." Berlin [u.a.] : Springer, 2008. http://dx.doi.org/10.1007/978-3-540-75858-7.
Повний текст джерелаWilliams, Trevor K. "Combinatorial Games on Graphs." DigitalCommons@USU, 2017. https://digitalcommons.usu.edu/etd/6502.
Повний текст джерелаWang, Jiaxin. "Various pushing methods on grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=839.
Повний текст джерелаTitle from document title page. Document formatted into pages; contains v, 39 p. : ill. (some col.) Includes abstract. Includes bibliographical references (p. 39).
Hunt, D'Hania J. "Constructing higher-order de Bruijn graphs." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FHunt.pdf.
Повний текст джерелаThesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.
Meagher, Karen. "Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory." Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/29234.
Повний текст джерелаSong, Zengmin. "Cycles and coloring in graphs." HKBU Institutional Repository, 2001. http://repository.hkbu.edu.hk/etd_ra/285.
Повний текст джерелаNgô, Van Chan. "Formal verification of a synchronous data-flow compiler : from Signal to C." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01067477.
Повний текст джерелаHill, Alan. "Self-Dual Graphs." Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1014.
Повний текст джерелаOlariu, Stephan. "Results on perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=73997.
Повний текст джерелаHearn, John. "Kolmogorov Complexity of Graphs." Scholarship @ Claremont, 2006. https://scholarship.claremont.edu/hmc_theses/182.
Повний текст джерелаFerra, Gomes de Almeida Girão António José. "Extremal and structural problems of graphs." Thesis, University of Cambridge, 2019. https://www.repository.cam.ac.uk/handle/1810/285427.
Повний текст джерелаHeckman, Christopher Carl. "Independent sets in bounded degree graphs." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/29163.
Повний текст джерелаLo, Allan. "Cliques in graphs." Thesis, University of Cambridge, 2010. https://www.repository.cam.ac.uk/handle/1810/237438.
Повний текст джерелаNorine, Serguei. "Matching structure and Pfaffian orientations of graphs." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7232.
Повний текст джерелаWhite, M. D. "Cycles in edge-coloured graphs and subgraphs of random graphs." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:95ef351e-acb1-442c-adf5-970487e30a4d.
Повний текст джерелаAli, Seema. "Colouring generalized Kneser graphs and homotopy theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0014/MQ34938.pdf.
Повний текст джерелаDickson, James Odziemiec. "An Introduction to Ramsey Theory on Graphs." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/32873.
Повний текст джерелаBrody, Justin. "On the model theory of random graphs." College Park, Md. : University of Maryland, 2009. http://hdl.handle.net/1903/9291.
Повний текст джерелаThesis research directed by: Dept. of Mathematics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
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.
Повний текст джерела