Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(DIRECTED GRAPHS GRAPH THEORY ). Showing records 1 – 30 of 63227 total matches.

[1] [2] [3] [4] [5] … [2108]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Christopher, Jeffrey. Induced path number for the complementary prism of a grid graph.

Degree: 2019, University of Tennessee – Chattanooga

 The induced path number rho(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can… (more)

Subjects/Keywords: Graph theory; Directed graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Christopher, J. (2019). Induced path number for the complementary prism of a grid graph. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/594

Chicago Manual of Style (16th Edition):

Christopher, Jeffrey. “Induced path number for the complementary prism of a grid graph.” 2019. Masters Thesis, University of Tennessee – Chattanooga. Accessed December 09, 2019. https://scholar.utc.edu/theses/594.

MLA Handbook (7th Edition):

Christopher, Jeffrey. “Induced path number for the complementary prism of a grid graph.” 2019. Web. 09 Dec 2019.

Vancouver:

Christopher J. Induced path number for the complementary prism of a grid graph. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2019 Dec 09]. Available from: https://scholar.utc.edu/theses/594.

Council of Science Editors:

Christopher J. Induced path number for the complementary prism of a grid graph. [Masters Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/594


Hong Kong University of Science and Technology

2. Wang, Wenjie. Arc ideals and Cohen-Macaulay digraphs.

Degree: 2009, Hong Kong University of Science and Technology

 In this thesis I introduce the concepts of arc ideals, unmixed digraphs, and Cohen-Macaulay digraphs, and study their algebraic and combinatorial properties by using commutative… (more)

Subjects/Keywords: Graph theory; Directed graphs; Cohen-Macaulay rings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, W. (2009). Arc ideals and Cohen-Macaulay digraphs. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1070096 ; http://repository.ust.hk/ir/bitstream/1783.1-7530/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Wenjie. “Arc ideals and Cohen-Macaulay digraphs.” 2009. Thesis, Hong Kong University of Science and Technology. Accessed December 09, 2019. https://doi.org/10.14711/thesis-b1070096 ; http://repository.ust.hk/ir/bitstream/1783.1-7530/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Wenjie. “Arc ideals and Cohen-Macaulay digraphs.” 2009. Web. 09 Dec 2019.

Vancouver:

Wang W. Arc ideals and Cohen-Macaulay digraphs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2009. [cited 2019 Dec 09]. Available from: https://doi.org/10.14711/thesis-b1070096 ; http://repository.ust.hk/ir/bitstream/1783.1-7530/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang W. Arc ideals and Cohen-Macaulay digraphs. [Thesis]. Hong Kong University of Science and Technology; 2009. Available from: https://doi.org/10.14711/thesis-b1070096 ; http://repository.ust.hk/ir/bitstream/1783.1-7530/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Lethbridge

3. University of Lethbridge. Faculty of Arts and Science. Energy of graphs and digraphs .

Degree: 2010, University of Lethbridge

 The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the… (more)

Subjects/Keywords: Graph theory; Directed graphs; Eigenvalues; Dissertations, Academic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Science, U. o. L. F. o. A. a. (2010). Energy of graphs and digraphs . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/2489

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Energy of graphs and digraphs .” 2010. Thesis, University of Lethbridge. Accessed December 09, 2019. http://hdl.handle.net/10133/2489.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Energy of graphs and digraphs .” 2010. Web. 09 Dec 2019.

Vancouver:

Science UoLFoAa. Energy of graphs and digraphs . [Internet] [Thesis]. University of Lethbridge; 2010. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10133/2489.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Energy of graphs and digraphs . [Thesis]. University of Lethbridge; 2010. Available from: http://hdl.handle.net/10133/2489

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Simon Fraser University

4. Bauslaugh, Bruce Lloyd. Homomorphisms of infinite directed graphs.

Degree: 1994, Simon Fraser University

Subjects/Keywords: Directed graphs.; Homomorphisms (Mathematics); Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bauslaugh, B. L. (1994). Homomorphisms of infinite directed graphs. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6543

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bauslaugh, Bruce Lloyd. “Homomorphisms of infinite directed graphs.” 1994. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/6543.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bauslaugh, Bruce Lloyd. “Homomorphisms of infinite directed graphs.” 1994. Web. 09 Dec 2019.

Vancouver:

Bauslaugh BL. Homomorphisms of infinite directed graphs. [Internet] [Thesis]. Simon Fraser University; 1994. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/6543.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bauslaugh BL. Homomorphisms of infinite directed graphs. [Thesis]. Simon Fraser University; 1994. Available from: http://summit.sfu.ca/item/6543

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of South Africa

5. Van der Linde, Jan Johannes. Enlarging directed graphs to ensure all nodes are contained.

Degree: 2015, University of South Africa

Graph augmentation concerns the addition of edges to a graph to satisfy some connectivity property of a graph. Previous research in this field has been… (more)

Subjects/Keywords: Directed graphs; Graph enlargement; Cycle picking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Van der Linde, J. J. (2015). Enlarging directed graphs to ensure all nodes are contained. (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/21520

Chicago Manual of Style (16th Edition):

Van der Linde, Jan Johannes. “Enlarging directed graphs to ensure all nodes are contained.” 2015. Masters Thesis, University of South Africa. Accessed December 09, 2019. http://hdl.handle.net/10500/21520.

MLA Handbook (7th Edition):

Van der Linde, Jan Johannes. “Enlarging directed graphs to ensure all nodes are contained.” 2015. Web. 09 Dec 2019.

Vancouver:

Van der Linde JJ. Enlarging directed graphs to ensure all nodes are contained. [Internet] [Masters thesis]. University of South Africa; 2015. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10500/21520.

Council of Science Editors:

Van der Linde JJ. Enlarging directed graphs to ensure all nodes are contained. [Masters Thesis]. University of South Africa; 2015. Available from: http://hdl.handle.net/10500/21520


University of Victoria

6. Young, Kailyn M. 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

 A 2-dipath k-colouring of an oriented graph G is an assignment of k colours, 1,2, . . . , k, to the vertices of G… (more)

Subjects/Keywords: graph theory; oriented graphs; tournaments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Young, K. M. (2011). 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3277

Chicago Manual of Style (16th Edition):

Young, Kailyn M. “2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings.” 2011. Masters Thesis, University of Victoria. Accessed December 09, 2019. http://hdl.handle.net/1828/3277.

MLA Handbook (7th Edition):

Young, Kailyn M. “2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings.” 2011. Web. 09 Dec 2019.

Vancouver:

Young KM. 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings. [Internet] [Masters thesis]. University of Victoria; 2011. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1828/3277.

Council of Science Editors:

Young KM. 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings. [Masters Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3277


University of Newcastle

7. Marshall, Kim. Extremal networks and connectivity.

Degree: PhD, 2011, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

In this thesis we consider questions in two separate but related research areas in the field of graph(more)

Subjects/Keywords: extremal graphs; connectivity; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Marshall, K. (2011). Extremal networks and connectivity. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/927974

Chicago Manual of Style (16th Edition):

Marshall, Kim. “Extremal networks and connectivity.” 2011. Doctoral Dissertation, University of Newcastle. Accessed December 09, 2019. http://hdl.handle.net/1959.13/927974.

MLA Handbook (7th Edition):

Marshall, Kim. “Extremal networks and connectivity.” 2011. Web. 09 Dec 2019.

Vancouver:

Marshall K. Extremal networks and connectivity. [Internet] [Doctoral dissertation]. University of Newcastle; 2011. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1959.13/927974.

Council of Science Editors:

Marshall K. Extremal networks and connectivity. [Doctoral Dissertation]. University of Newcastle; 2011. Available from: http://hdl.handle.net/1959.13/927974

8. Plaisted, Daniel. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.

Degree: 2019, University of Tennessee – Chattanooga

 This thesis regards the minimum rank and minimum positive semidefinite rank of a simple graph. A graph parameter, called the minimum labeling degree (mld), is… (more)

Subjects/Keywords: Graph theory; Representations of graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Plaisted, D. (2019). On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/611

Chicago Manual of Style (16th Edition):

Plaisted, Daniel. “On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.” 2019. Masters Thesis, University of Tennessee – Chattanooga. Accessed December 09, 2019. https://scholar.utc.edu/theses/611.

MLA Handbook (7th Edition):

Plaisted, Daniel. “On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.” 2019. Web. 09 Dec 2019.

Vancouver:

Plaisted D. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2019 Dec 09]. Available from: https://scholar.utc.edu/theses/611.

Council of Science Editors:

Plaisted D. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. [Masters Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/611

9. Gutierrez Alva, Juan Gabriel. O problema do multicorte dirigido mínimo.

Degree: Mestrado, Ciência da Computação, 2012, University of São Paulo

O Problema do Multicorte Dirigido Mínimo é um problema clássico em otimização combinatória. Ele é NP-difícil mesmo para instâncias muito simples. Este trabalho faz uma… (more)

Subjects/Keywords: algorithms in graphs; algoritmos em grafos; directed multicut; graph theory; multicommodity disconnecting set.; multicommodity disconnecting set.; multicorte dirigido; teoria dos grafos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gutierrez Alva, J. G. (2012). O problema do multicorte dirigido mínimo. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22012013-160000/ ;

Chicago Manual of Style (16th Edition):

Gutierrez Alva, Juan Gabriel. “O problema do multicorte dirigido mínimo.” 2012. Masters Thesis, University of São Paulo. Accessed December 09, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22012013-160000/ ;.

MLA Handbook (7th Edition):

Gutierrez Alva, Juan Gabriel. “O problema do multicorte dirigido mínimo.” 2012. Web. 09 Dec 2019.

Vancouver:

Gutierrez Alva JG. O problema do multicorte dirigido mínimo. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2019 Dec 09]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22012013-160000/ ;.

Council of Science Editors:

Gutierrez Alva JG. O problema do multicorte dirigido mínimo. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22012013-160000/ ;

10. Uematsu, Naoya. Lights out game with cellular automation.

Degree: 2016, University of Northern Iowa

1 PDF file (x, 53 pages) Advisors/Committee Members: Douglas J. Shaw, Chair.

Subjects/Keywords: Directed graphs; Graph theory; Combinatorial geometry; Lights out (Game)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Uematsu, N. (2016). Lights out game with cellular automation. (Thesis). University of Northern Iowa. Retrieved from https://scholarworks.uni.edu/etd/234

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Uematsu, Naoya. “Lights out game with cellular automation.” 2016. Thesis, University of Northern Iowa. Accessed December 09, 2019. https://scholarworks.uni.edu/etd/234.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Uematsu, Naoya. “Lights out game with cellular automation.” 2016. Web. 09 Dec 2019.

Vancouver:

Uematsu N. Lights out game with cellular automation. [Internet] [Thesis]. University of Northern Iowa; 2016. [cited 2019 Dec 09]. Available from: https://scholarworks.uni.edu/etd/234.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Uematsu N. Lights out game with cellular automation. [Thesis]. University of Northern Iowa; 2016. Available from: https://scholarworks.uni.edu/etd/234

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Kansas State University

11. Chowdhury, Zahirul Kabir. The representation of data base relations through digraphs.

Degree: 1984, Kansas State University

Subjects/Keywords: Directed graphs; Graph theory; Database management – Computer programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chowdhury, Z. K. (1984). The representation of data base relations through digraphs. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9722

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chowdhury, Zahirul Kabir. “The representation of data base relations through digraphs.” 1984. Thesis, Kansas State University. Accessed December 09, 2019. http://hdl.handle.net/2097/9722.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chowdhury, Zahirul Kabir. “The representation of data base relations through digraphs.” 1984. Web. 09 Dec 2019.

Vancouver:

Chowdhury ZK. The representation of data base relations through digraphs. [Internet] [Thesis]. Kansas State University; 1984. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2097/9722.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chowdhury ZK. The representation of data base relations through digraphs. [Thesis]. Kansas State University; 1984. Available from: http://hdl.handle.net/2097/9722

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Molla, Theodore. On Tiling Directed Graphs with Cycles and Tournaments.

Degree: PhD, Mathematics, 2013, Arizona State University

 A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph H then the tiling is… (more)

Subjects/Keywords: Mathematics; Combinatorics; Directed Graphs; Graph Theory

…vertices. 14 1.5 Tiling directed graphs with cycles Call a graph r-regular if d(v)… …x29; : v ∈ V }. A tournament is a directed graph in which there is exactly one edge… …x29; ≥ n/2. We now consider this same type of problem when G and H are directed graphs. We… …m) to be the directed graph formed from GI (n, m) by replacing all edges… …x28;D) ≥ 2k k+1 − 2. We say a directed graph D is strongly d-connected if for any… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Molla, T. (2013). On Tiling Directed Graphs with Cycles and Tournaments. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/18715

Chicago Manual of Style (16th Edition):

Molla, Theodore. “On Tiling Directed Graphs with Cycles and Tournaments.” 2013. Doctoral Dissertation, Arizona State University. Accessed December 09, 2019. http://repository.asu.edu/items/18715.

MLA Handbook (7th Edition):

Molla, Theodore. “On Tiling Directed Graphs with Cycles and Tournaments.” 2013. Web. 09 Dec 2019.

Vancouver:

Molla T. On Tiling Directed Graphs with Cycles and Tournaments. [Internet] [Doctoral dissertation]. Arizona State University; 2013. [cited 2019 Dec 09]. Available from: http://repository.asu.edu/items/18715.

Council of Science Editors:

Molla T. On Tiling Directed Graphs with Cycles and Tournaments. [Doctoral Dissertation]. Arizona State University; 2013. Available from: http://repository.asu.edu/items/18715


Ryerson University

13. Patel, Sonal. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.

Degree: 2010, Ryerson University

 In this thesis we address three main problems in clique detection in the area of Graph Theory. i) Most of current methods for clique detection… (more)

Subjects/Keywords: Random graphs; Graph theory; Algorithms; Graph algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Patel, S. (2010). Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed December 09, 2019. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 09 Dec 2019.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2019 Dec 09]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Granger, Valerie, 1985-. GIT-equivalence and semi-stable subcategories of quiver representations.

Degree: 2016, University of Missouri – Columbia

 The main investigation in this thesis is to determine when two weights give rise to the same semi-stable subcategory in the case of representations of… (more)

Subjects/Keywords: Directed graphs; Representations of graphs; Paths and cycles (Graph theory)

…quivers, which are simply directed graphs. Quivers and their representations occur most… …Notions for Quivers A quiver is a directed graph. That is, a quiver consists of Q = (Q0… …naturally in representation theory of finite dimensional algebras. They turn out to have an… …theory, the main objects of study are the so-called semi-stable representations. These are… …Mumford criterion in Geometric Invariant Theory. Semistable representations play a central role… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Granger, Valerie, 1. (2016). GIT-equivalence and semi-stable subcategories of quiver representations. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/56527

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Granger, Valerie, 1985-. “GIT-equivalence and semi-stable subcategories of quiver representations.” 2016. Thesis, University of Missouri – Columbia. Accessed December 09, 2019. http://hdl.handle.net/10355/56527.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Granger, Valerie, 1985-. “GIT-equivalence and semi-stable subcategories of quiver representations.” 2016. Web. 09 Dec 2019.

Vancouver:

Granger, Valerie 1. GIT-equivalence and semi-stable subcategories of quiver representations. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10355/56527.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Granger, Valerie 1. GIT-equivalence and semi-stable subcategories of quiver representations. [Thesis]. University of Missouri – Columbia; 2016. Available from: http://hdl.handle.net/10355/56527

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

15. Rajendraprasad, Deepak. Rainbow Colouring and Some Dimensional Problems in Graph Theory.

Degree: 2013, Indian Institute of Science

 This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is… (more)

Subjects/Keywords: Graph Theory; Rainbow Coloring - Graphs; Product Dimension - Graphs; Boxicity; Cubicity; Hypergraphs; Product Graphs; Forests Graphs; Treewidth Graphs; Tree (Graph Theory); Split Graphs; Threshold Graphs; Graph - Coloring; Rainbow Connection; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rajendraprasad, D. (2013). Rainbow Colouring and Some Dimensional Problems in Graph Theory. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2013. Thesis, Indian Institute of Science. Accessed December 09, 2019. http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2013. Web. 09 Dec 2019.

Vancouver:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2019 Dec 09]. Available from: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Colorado

16. Fox, Alyson Lindsey. Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs.

Degree: PhD, Applied Mathematics, 2017, University of Colorado

  Relational datasets are often modeled as an unsigned, undirected graph due the nice properties of the resulting graph Laplacian, but information is lost if… (more)

Subjects/Keywords: Algebraic Multigrid; Directed graphs; Graph Laplacians; Gremban's expansion; Signed graphs; Applied Mechanics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fox, A. L. (2017). Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/96

Chicago Manual of Style (16th Edition):

Fox, Alyson Lindsey. “Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Doctoral Dissertation, University of Colorado. Accessed December 09, 2019. https://scholar.colorado.edu/appm_gradetds/96.

MLA Handbook (7th Edition):

Fox, Alyson Lindsey. “Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Web. 09 Dec 2019.

Vancouver:

Fox AL. Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs. [Internet] [Doctoral dissertation]. University of Colorado; 2017. [cited 2019 Dec 09]. Available from: https://scholar.colorado.edu/appm_gradetds/96.

Council of Science Editors:

Fox AL. Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs. [Doctoral Dissertation]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/96


University of Colorado

17. Fox, Alyson Lindsey. Algebraic Multigrid(AMG) for Graph Laplacian Linear Systems: Extensions of AMG for Signed, Undirected and Unsigned, Directed Graphs.

Degree: PhD, 2017, University of Colorado

  Relational datasets are often modeled as an unsigned, undirected graph due the nice properties of the resulting graph Laplacian, but information is lost if… (more)

Subjects/Keywords: algebraic multigrid; directed graphs; graph laplacians; gremban's expansion; signed graphs; Algebra; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fox, A. L. (2017). Algebraic Multigrid(AMG) for Graph Laplacian Linear Systems: Extensions of AMG for Signed, Undirected and Unsigned, Directed Graphs. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/121

Chicago Manual of Style (16th Edition):

Fox, Alyson Lindsey. “Algebraic Multigrid(AMG) for Graph Laplacian Linear Systems: Extensions of AMG for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Doctoral Dissertation, University of Colorado. Accessed December 09, 2019. https://scholar.colorado.edu/appm_gradetds/121.

MLA Handbook (7th Edition):

Fox, Alyson Lindsey. “Algebraic Multigrid(AMG) for Graph Laplacian Linear Systems: Extensions of AMG for Signed, Undirected and Unsigned, Directed Graphs.” 2017. Web. 09 Dec 2019.

Vancouver:

Fox AL. Algebraic Multigrid(AMG) for Graph Laplacian Linear Systems: Extensions of AMG for Signed, Undirected and Unsigned, Directed Graphs. [Internet] [Doctoral dissertation]. University of Colorado; 2017. [cited 2019 Dec 09]. Available from: https://scholar.colorado.edu/appm_gradetds/121.

Council of Science Editors:

Fox AL. Algebraic Multigrid(AMG) for Graph Laplacian Linear Systems: Extensions of AMG for Signed, Undirected and Unsigned, Directed Graphs. [Doctoral Dissertation]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/121


Virginia Tech

18. Misra, Supratik Kumar. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers.

Degree: MS, Electrical and Computer Engineering, 2012, Virginia Tech

 Continuous advances in VLSI technology have led to more complex digital designs and shrinking transistor sizes. Due to these developments, design verification and manufacturing test… (more)

Subjects/Keywords: Directed Acyclic Graph; Partial Scan Design; Pattern Debugger; Implication Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Misra, S. K. (2012). Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31153

Chicago Manual of Style (16th Edition):

Misra, Supratik Kumar. “Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers.” 2012. Masters Thesis, Virginia Tech. Accessed December 09, 2019. http://hdl.handle.net/10919/31153.

MLA Handbook (7th Edition):

Misra, Supratik Kumar. “Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers.” 2012. Web. 09 Dec 2019.

Vancouver:

Misra SK. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. [Internet] [Masters thesis]. Virginia Tech; 2012. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10919/31153.

Council of Science Editors:

Misra SK. Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers. [Masters Thesis]. Virginia Tech; 2012. Available from: http://hdl.handle.net/10919/31153


University of Miami

19. Ellzey, Brittney. On Chromatic Quasisymmetric Functions of Directed Graphs.

Degree: PhD, Mathematics (Arts and Sciences), 2018, University of Miami

 In 1912, Birkhoff introduced the chromatic polynomial of a graph, which counts the number of proper colorings of a graph. In 1995, Stanley introduced the… (more)

Subjects/Keywords: symmetric function; graph coloring; chromatic polynomial; directed graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ellzey, B. (2018). On Chromatic Quasisymmetric Functions of Directed Graphs. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/2091

Chicago Manual of Style (16th Edition):

Ellzey, Brittney. “On Chromatic Quasisymmetric Functions of Directed Graphs.” 2018. Doctoral Dissertation, University of Miami. Accessed December 09, 2019. https://scholarlyrepository.miami.edu/oa_dissertations/2091.

MLA Handbook (7th Edition):

Ellzey, Brittney. “On Chromatic Quasisymmetric Functions of Directed Graphs.” 2018. Web. 09 Dec 2019.

Vancouver:

Ellzey B. On Chromatic Quasisymmetric Functions of Directed Graphs. [Internet] [Doctoral dissertation]. University of Miami; 2018. [cited 2019 Dec 09]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2091.

Council of Science Editors:

Ellzey B. On Chromatic Quasisymmetric Functions of Directed Graphs. [Doctoral Dissertation]. University of Miami; 2018. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2091

20. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

 In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node… (more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed December 09, 2019. http://hdl.handle.net/10045/98110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 09 Dec 2019.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10045/98110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


KTH

21. Aspegren, Villiam. CluStic – Automatic graph drawing with clusters.

Degree: Computer Science and Communication (CSC), 2015, KTH

<h2>Abstract</h2> Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been… (more)

Subjects/Keywords: Graph drawing; Automatic graph layout; Directed graphs; Sugiyama; Cluster; Clusters; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aspegren, V. (2015). CluStic – Automatic graph drawing with clusters. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Thesis, KTH. Accessed December 09, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Web. 09 Dec 2019.

Vancouver:

Aspegren V. CluStic – Automatic graph drawing with clusters. [Internet] [Thesis]. KTH; 2015. [cited 2019 Dec 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aspegren V. CluStic – Automatic graph drawing with clusters. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Alberta

22. Enright, Jessica Anne. Results on Set Representations of Graphs.

Degree: PhD, Department of Computing Science, 2011, University of Alberta

 A set representation of a graph is an assignment of sets to vertices such that two vertices are adjacent if and only if their assigned… (more)

Subjects/Keywords: intersection graphs; combinatorial games; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Enright, J. A. (2011). Results on Set Representations of Graphs. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/41687k094

Chicago Manual of Style (16th Edition):

Enright, Jessica Anne. “Results on Set Representations of Graphs.” 2011. Doctoral Dissertation, University of Alberta. Accessed December 09, 2019. https://era.library.ualberta.ca/files/41687k094.

MLA Handbook (7th Edition):

Enright, Jessica Anne. “Results on Set Representations of Graphs.” 2011. Web. 09 Dec 2019.

Vancouver:

Enright JA. Results on Set Representations of Graphs. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2019 Dec 09]. Available from: https://era.library.ualberta.ca/files/41687k094.

Council of Science Editors:

Enright JA. Results on Set Representations of Graphs. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/41687k094


Hong Kong University of Science and Technology

23. Abeynayake, Hiddadura Isura Malinda Mendis. Effectiveness of static data representation.

Degree: 2016, Hong Kong University of Science and Technology

Graphs are a means to convey the numerical information in day to day life so that they can be seeing and understood. Effective ways to… (more)

Subjects/Keywords: Information visualization; Representations of graphs; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Abeynayake, H. I. M. M. (2016). Effectiveness of static data representation. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Abeynayake, Hiddadura Isura Malinda Mendis. “Effectiveness of static data representation.” 2016. Thesis, Hong Kong University of Science and Technology. Accessed December 09, 2019. https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Abeynayake, Hiddadura Isura Malinda Mendis. “Effectiveness of static data representation.” 2016. Web. 09 Dec 2019.

Vancouver:

Abeynayake HIMM. Effectiveness of static data representation. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2016. [cited 2019 Dec 09]. Available from: https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abeynayake HIMM. Effectiveness of static data representation. [Thesis]. Hong Kong University of Science and Technology; 2016. Available from: https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

24. Sato, Cristiane Maria. Core Structures in Random Graphs and Hypergraphs.

Degree: 2013, University of Waterloo

 The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by… (more)

Subjects/Keywords: combinatorics; graph theory; random graphs; probabilistic; enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sato, C. M. (2013). Core Structures in Random Graphs and Hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7787

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Thesis, University of Waterloo. Accessed December 09, 2019. http://hdl.handle.net/10012/7787.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Web. 09 Dec 2019.

Vancouver:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10012/7787.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7787

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – San Diego

25. Tobin, Robin Joshua. Extremal Spectral Invariants of Graphs.

Degree: Mathematics, 2017, University of California – San Diego

 We address several problems in spectral graph theory, with a common theme of optimizing or computing a spectral graph invariant, such as the spectral radius… (more)

Subjects/Keywords: Mathematics; graph theory; planar graphs; spectral graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tobin, R. J. (2017). Extremal Spectral Invariants of Graphs. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/8pw2j45q

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tobin, Robin Joshua. “Extremal Spectral Invariants of Graphs.” 2017. Thesis, University of California – San Diego. Accessed December 09, 2019. http://www.escholarship.org/uc/item/8pw2j45q.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tobin, Robin Joshua. “Extremal Spectral Invariants of Graphs.” 2017. Web. 09 Dec 2019.

Vancouver:

Tobin RJ. Extremal Spectral Invariants of Graphs. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/8pw2j45q.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tobin RJ. Extremal Spectral Invariants of Graphs. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/8pw2j45q

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

26. Lee, Edward. Circle Graph Obstructions.

Degree: 2017, University of Waterloo

In this thesis we present a self-contained proof of Bouchet’s characterization of the class of circle graphs. The proof uses signed graphs and is analogous to Gerards’ graphic proof of Tutte’s excluded-minor characterization of the class of graphic matroids.

Subjects/Keywords: Circle Graphs; Structural Graph Theory; Graph Theory; Vertex Minors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lee, E. (2017). Circle Graph Obstructions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12309

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lee, Edward. “Circle Graph Obstructions.” 2017. Thesis, University of Waterloo. Accessed December 09, 2019. http://hdl.handle.net/10012/12309.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lee, Edward. “Circle Graph Obstructions.” 2017. Web. 09 Dec 2019.

Vancouver:

Lee E. Circle Graph Obstructions. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10012/12309.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee E. Circle Graph Obstructions. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12309

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Univerzitet u Beogradu

27. Mihailović, Bojana Lj., 1960-. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.

Degree: Matematički fakultet, 2017, Univerzitet u Beogradu

Matematika - Spektralna teorija grafova / Mathematics - Spectral graph theory

Predmet ove disertacije pripada oblasti spektralne teorije grafova, mladoj grani matematičke kombinatorike, odnosno teorije… (more)

Subjects/Keywords: spectral graph theory; second largest eigenvalue; hereditary graph property; maximal graphs; minimal forbidden graphs; treelike graphs (cacti); reflexive graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mihailović, Bojana Lj., 1. (2017). Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mihailović, Bojana Lj., 1960-. “Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.” 2017. Thesis, Univerzitet u Beogradu. Accessed December 09, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mihailović, Bojana Lj., 1960-. “Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.” 2017. Web. 09 Dec 2019.

Vancouver:

Mihailović, Bojana Lj. 1. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. [Internet] [Thesis]. Univerzitet u Beogradu; 2017. [cited 2019 Dec 09]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mihailović, Bojana Lj. 1. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. [Thesis]. Univerzitet u Beogradu; 2017. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

28. Samotij, Wojciech. Extremal problems in pseudo-random graphs and asymptotic enumeration.

Degree: PhD, 0439, 2010, University of Illinois – Urbana-Champaign

 This dissertation tackles several questions in extremal graph theory and the theory of random graphs. It consists of three more or less independent parts that… (more)

Subjects/Keywords: combinatorics; graphs; graph theory; Extremal Graph Theory; probability; random; pseudo-random; quasi-random; random graphs; pseudo-random graphs; Ramsey; Ramsey theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Samotij, W. (2010). Extremal problems in pseudo-random graphs and asymptotic enumeration. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/15574

Chicago Manual of Style (16th Edition):

Samotij, Wojciech. “Extremal problems in pseudo-random graphs and asymptotic enumeration.” 2010. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 09, 2019. http://hdl.handle.net/2142/15574.

MLA Handbook (7th Edition):

Samotij, Wojciech. “Extremal problems in pseudo-random graphs and asymptotic enumeration.” 2010. Web. 09 Dec 2019.

Vancouver:

Samotij W. Extremal problems in pseudo-random graphs and asymptotic enumeration. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2142/15574.

Council of Science Editors:

Samotij W. Extremal problems in pseudo-random graphs and asymptotic enumeration. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/15574


Indian Institute of Science

29. Basavaraju, Manu. Acyclic Edge Coloring Of Graphs.

Degree: 2010, Indian Institute of Science

 A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e)… (more)

Subjects/Keywords: Graph - Coloring; Graph Theory; Graphs - Acyclic Edge Coloring; Subcubic Graphs; 2-Degenerate Graphs; Planar Graphs; Acyclic Edge Coloring; Dense Graphs; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Basavaraju, M. (2010). Acyclic Edge Coloring Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2263

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Basavaraju, Manu. “Acyclic Edge Coloring Of Graphs.” 2010. Thesis, Indian Institute of Science. Accessed December 09, 2019. http://hdl.handle.net/2005/2263.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Basavaraju, Manu. “Acyclic Edge Coloring Of Graphs.” 2010. Web. 09 Dec 2019.

Vancouver:

Basavaraju M. Acyclic Edge Coloring Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2005/2263.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Basavaraju M. Acyclic Edge Coloring Of Graphs. [Thesis]. Indian Institute of Science; 2010. Available from: http://hdl.handle.net/2005/2263

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

30. Basavaraju, Manu. Acyclic Edge Coloring Of Graphs.

Degree: 2010, Indian Institute of Science

 A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e)… (more)

Subjects/Keywords: Graph - Coloring; Graph Theory; Graphs - Acyclic Edge Coloring; Subcubic Graphs; 2-Degenerate Graphs; Planar Graphs; Acyclic Edge Coloring; Dense Graphs; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Basavaraju, M. (2010). Acyclic Edge Coloring Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2263 ; http://etd.ncsi.iisc.ernet.in/abstracts/2885/G24692-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Basavaraju, Manu. “Acyclic Edge Coloring Of Graphs.” 2010. Thesis, Indian Institute of Science. Accessed December 09, 2019. http://etd.iisc.ernet.in/handle/2005/2263 ; http://etd.ncsi.iisc.ernet.in/abstracts/2885/G24692-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Basavaraju, Manu. “Acyclic Edge Coloring Of Graphs.” 2010. Web. 09 Dec 2019.

Vancouver:

Basavaraju M. Acyclic Edge Coloring Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2019 Dec 09]. Available from: http://etd.iisc.ernet.in/handle/2005/2263 ; http://etd.ncsi.iisc.ernet.in/abstracts/2885/G24692-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Basavaraju M. Acyclic Edge Coloring Of Graphs. [Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ernet.in/handle/2005/2263 ; http://etd.ncsi.iisc.ernet.in/abstracts/2885/G24692-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [2108]

.