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:(Random d regular Graphs). Showing records 1 – 30 of 20519 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of South Carolina

1. Clifton, Ann Wells. The Packing Chromatic Number of Random d-regular Graphs.

Degree: MS, Mathematics, 2015, University of South Carolina

  Let G = (V (G),E(G)) be a simple graph of order n and let i be a positive integer. Xi superset V (G) is… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Packing Chromatic Number; Random d-regular Graphs; Configuration model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clifton, A. W. (2015). The Packing Chromatic Number of Random d-regular Graphs. (Masters Thesis). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/3697

Chicago Manual of Style (16th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Masters Thesis, University of South Carolina. Accessed July 14, 2020. https://scholarcommons.sc.edu/etd/3697.

MLA Handbook (7th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Web. 14 Jul 2020.

Vancouver:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Internet] [Masters thesis]. University of South Carolina; 2015. [cited 2020 Jul 14]. Available from: https://scholarcommons.sc.edu/etd/3697.

Council of Science Editors:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Masters Thesis]. University of South Carolina; 2015. Available from: https://scholarcommons.sc.edu/etd/3697


Rutgers University

2. Baron, Jacob D., 1988-. Two problems on cycles in random graphs.

Degree: PhD, Mathematics, 2016, Rutgers University

We prove three results. First, an old conjecture of Zs. Tuza says that for any graph G, the ratio of the minimum size, τ3(G), of… (more)

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baron, Jacob D., 1. (2016). Two problems on cycles in random graphs. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51229/

Chicago Manual of Style (16th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Doctoral Dissertation, Rutgers University. Accessed July 14, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

MLA Handbook (7th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Web. 14 Jul 2020.

Vancouver:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Jul 14]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

Council of Science Editors:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/


ETH Zürich

3. Kamčev, Nina. Colourings of Graphs and Words.

Degree: 2018, ETH Zürich

 Extremal graph theory is concerned with the extreme values of a graph parameter over various classes of graphs. Randomised constructions have played a major role… (more)

Subjects/Keywords: random graphs; Ramsey theory; Graph theory; Random regular graph; Random processes; Hales-Jewett theorem; Local lemma; info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamčev, N. (2018). Colourings of Graphs and Words. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/282692

Chicago Manual of Style (16th Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Doctoral Dissertation, ETH Zürich. Accessed July 14, 2020. http://hdl.handle.net/20.500.11850/282692.

MLA Handbook (7th Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Web. 14 Jul 2020.

Vancouver:

Kamčev N. Colourings of Graphs and Words. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/20.500.11850/282692.

Council of Science Editors:

Kamčev N. Colourings of Graphs and Words. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/282692


The Ohio State University

4. Poole, Daniel James. A Study of Random Hypergraphs and Directed Graphs.

Degree: PhD, Mathematics, 2014, The Ohio State University

 We establish and describe the likely structure of random hypergraph and directed graph models, expanding upon classical results that pertain to the likely structure of… (more)

Subjects/Keywords: Mathematics; Random Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Poole, D. J. (2014). A Study of Random Hypergraphs and Directed Graphs. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674

Chicago Manual of Style (16th Edition):

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Doctoral Dissertation, The Ohio State University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674.

MLA Handbook (7th Edition):

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674.

Council of Science Editors:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674


Oregon State University

5. Choi, In-kyeong. On straight line representations of random planar graphs.

Degree: PhD, Mathematics, 1992, Oregon State University

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, I. (1992). On straight line representations of random planar graphs. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/16942

Chicago Manual of Style (16th Edition):

Choi, In-kyeong. “On straight line representations of random planar graphs.” 1992. Doctoral Dissertation, Oregon State University. Accessed July 14, 2020. http://hdl.handle.net/1957/16942.

MLA Handbook (7th Edition):

Choi, In-kyeong. “On straight line representations of random planar graphs.” 1992. Web. 14 Jul 2020.

Vancouver:

Choi I. On straight line representations of random planar graphs. [Internet] [Doctoral dissertation]. Oregon State University; 1992. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1957/16942.

Council of Science Editors:

Choi I. On straight line representations of random planar graphs. [Doctoral Dissertation]. Oregon State University; 1992. Available from: http://hdl.handle.net/1957/16942


Michigan State University

6. Spencer, Joseph J. Probabilistic threshold for collapsibility in random graphs.

Degree: PhD, Department of Mathematics, 1993, Michigan State University

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Spencer, J. J. (1993). Probabilistic threshold for collapsibility in random graphs. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:22491

Chicago Manual of Style (16th Edition):

Spencer, Joseph J. “Probabilistic threshold for collapsibility in random graphs.” 1993. Doctoral Dissertation, Michigan State University. Accessed July 14, 2020. http://etd.lib.msu.edu/islandora/object/etd:22491.

MLA Handbook (7th Edition):

Spencer, Joseph J. “Probabilistic threshold for collapsibility in random graphs.” 1993. Web. 14 Jul 2020.

Vancouver:

Spencer JJ. Probabilistic threshold for collapsibility in random graphs. [Internet] [Doctoral dissertation]. Michigan State University; 1993. [cited 2020 Jul 14]. Available from: http://etd.lib.msu.edu/islandora/object/etd:22491.

Council of Science Editors:

Spencer JJ. Probabilistic threshold for collapsibility in random graphs. [Doctoral Dissertation]. Michigan State University; 1993. Available from: http://etd.lib.msu.edu/islandora/object/etd:22491


Indian Institute of Science

7. Francis, Mathew C. Intersection Graphs Of Boxes And Cubes.

Degree: 2009, Indian Institute of Science

 A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such… (more)

Subjects/Keywords: Computer Graphics; Boxicity (Graphs); Cubicity (Graphs); Interval Graphs; Halin Graphs; Planar Graphs; Intersection Graphs; Random Graphs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Francis, M. C. (2009). Intersection Graphs Of Boxes And Cubes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1027

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):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2009. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://hdl.handle.net/2005/1027.

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

MLA Handbook (7th Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2009. Web. 14 Jul 2020.

Vancouver:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2005/1027.

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

Council of Science Editors:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/1027

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


Université Paris-Sud – Paris XI

8. Le Masson, Etienne. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.

Degree: Docteur es, Mathématiques, 2013, Université Paris-Sud – Paris XI

Dans cette thèse, nous étudions les propriétés de concentration des fonctions propres du laplacien discret sur des graphes réguliers de degré fixé dont le nombre… (more)

Subjects/Keywords: Fonctions propres du laplacien; Ergodicité quantique; Analyse semi-classique; Opérateurs pseudo-différentiels; Graphes réguliers; Grands graphes aléatoires; Laplacian eigenfunctions; Quantum ergodicity; Semi-classical analysis; Pseudo-differential operators; Regular graphs; Large random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le Masson, E. (2013). Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112179

Chicago Manual of Style (16th Edition):

Le Masson, Etienne. “Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed July 14, 2020. http://www.theses.fr/2013PA112179.

MLA Handbook (7th Edition):

Le Masson, Etienne. “Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.” 2013. Web. 14 Jul 2020.

Vancouver:

Le Masson E. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2013PA112179.

Council of Science Editors:

Le Masson E. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112179


Indian Institute of Science

9. Mathew, Rogers. Boxicity And Cubicity : A Study On Special Classes Of Graphs.

Degree: 2012, Indian Institute of Science

 Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping… (more)

Subjects/Keywords: Graphs; Boxicity; Leaf Powers; Random Grpahs; Line Graphs; Chordal Bipartite Graphs; Random Graphs; k-chordal Graphs; Crossing Number; Cubicity; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mathew, R. (2012). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2320

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):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://hdl.handle.net/2005/2320.

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

MLA Handbook (7th Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Web. 14 Jul 2020.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2005/2320.

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

Council of Science Editors:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2320

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


Indian Institute of Science

10. Mathew, Rogers. Boxicity And Cubicity : A Study On Special Classes Of Graphs.

Degree: 2012, Indian Institute of Science

 Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping… (more)

Subjects/Keywords: Graphs; Boxicity; Leaf Powers; Random Grpahs; Line Graphs; Chordal Bipartite Graphs; Random Graphs; k-chordal Graphs; Crossing Number; Cubicity; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mathew, R. (2012). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-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):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-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):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Web. 14 Jul 2020.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2020 Jul 14]. Available from: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-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:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf

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

11. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 14]. 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


University of Waterloo

12. Rooney, Brendan. Spectral Aspects of Cocliques in Graphs.

Degree: 2014, University of Waterloo

 This thesis considers spectral approaches to finding maximum cocliques in graphs. We focus on the relation between the eigenspaces of a graph and the size… (more)

Subjects/Keywords: Algebraic Graph Theory; Spectral Methods; Computational Complexity; Distance-Regular Graphs; Strongly Regular Graphs; Association Schemes; Eigenpolytopes; Veronese Matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rooney, B. (2014). Spectral Aspects of Cocliques in Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8409

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):

Rooney, Brendan. “Spectral Aspects of Cocliques in Graphs.” 2014. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/8409.

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

MLA Handbook (7th Edition):

Rooney, Brendan. “Spectral Aspects of Cocliques in Graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Rooney B. Spectral Aspects of Cocliques in Graphs. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/8409.

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

Council of Science Editors:

Rooney B. Spectral Aspects of Cocliques in Graphs. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8409

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


University of Delaware

13. McGinnis, Matt. Combinatorial and spectral properties of graphs and association schemes .

Degree: 2018, University of Delaware

 The main topics of this dissertation are related to spectral graph theory, a subtopic of algebraic combinatorics. Algebraic combinatorics is the area of mathematics that… (more)

Subjects/Keywords: Pure sciences; Association schemes; Distance-regular graphs; Graphs; Linear algebra; Spectral graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McGinnis, M. (2018). Combinatorial and spectral properties of graphs and association schemes . (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/23728

Chicago Manual of Style (16th Edition):

McGinnis, Matt. “Combinatorial and spectral properties of graphs and association schemes .” 2018. Doctoral Dissertation, University of Delaware. Accessed July 14, 2020. http://udspace.udel.edu/handle/19716/23728.

MLA Handbook (7th Edition):

McGinnis, Matt. “Combinatorial and spectral properties of graphs and association schemes .” 2018. Web. 14 Jul 2020.

Vancouver:

McGinnis M. Combinatorial and spectral properties of graphs and association schemes . [Internet] [Doctoral dissertation]. University of Delaware; 2018. [cited 2020 Jul 14]. Available from: http://udspace.udel.edu/handle/19716/23728.

Council of Science Editors:

McGinnis M. Combinatorial and spectral properties of graphs and association schemes . [Doctoral Dissertation]. University of Delaware; 2018. Available from: http://udspace.udel.edu/handle/19716/23728


University of Waterloo

14. Huang, Junbo. Bipartite Distance-Regular Graphs of Diameter Four.

Degree: 2014, University of Waterloo

 Using a method by Godsil and Roy, bipartite distance-regular graphs of diameter four can be used to construct {0,α}-sets, a generalization of the widely applied… (more)

Subjects/Keywords: Distance-Regular Graphs; Terwilliger Algebra; Unit Vectors with Few Inner Products; Krein Parameters; Halved Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, J. (2014). Bipartite Distance-Regular Graphs of Diameter Four. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8618

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):

Huang, Junbo. “Bipartite Distance-Regular Graphs of Diameter Four.” 2014. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/8618.

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

MLA Handbook (7th Edition):

Huang, Junbo. “Bipartite Distance-Regular Graphs of Diameter Four.” 2014. Web. 14 Jul 2020.

Vancouver:

Huang J. Bipartite Distance-Regular Graphs of Diameter Four. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/8618.

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

Council of Science Editors:

Huang J. Bipartite Distance-Regular Graphs of Diameter Four. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8618

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

15. Johnson, Tobias Lee. Eigenvalue fluctuations for random regular graphs.

Degree: PhD, 2014, University of Washington

 One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe… (more)

Subjects/Keywords: corners process; eigenvalue fluctuations; minors process; Poisson approximation; random regular graphs; Stein's method; Mathematics; mathematics

…sequence of growing graphs. 1.4.1 The uniform model A random d-regular graph on n vertices… …for introducing me to research and to random regular graphs. I’m grateful to her for… …method and try to apply it to cycle counts of random regular graphs has shaped my mathematical… …investigating properties of eigenvalues of random regular graphs from the perspective of random matrix… …theory. 1.2 Stein’s method applied to random regular graphs Graph eigenvalues have a close… 

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):

Johnson, T. L. (2014). Eigenvalue fluctuations for random regular graphs. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/26531

Chicago Manual of Style (16th Edition):

Johnson, Tobias Lee. “Eigenvalue fluctuations for random regular graphs.” 2014. Doctoral Dissertation, University of Washington. Accessed July 14, 2020. http://hdl.handle.net/1773/26531.

MLA Handbook (7th Edition):

Johnson, Tobias Lee. “Eigenvalue fluctuations for random regular graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Johnson TL. Eigenvalue fluctuations for random regular graphs. [Internet] [Doctoral dissertation]. University of Washington; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1773/26531.

Council of Science Editors:

Johnson TL. Eigenvalue fluctuations for random regular graphs. [Doctoral Dissertation]. University of Washington; 2014. Available from: http://hdl.handle.net/1773/26531


Ryerson University

16. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Jul 14]. 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


University of Waterloo

17. 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 July 14, 2020. 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. 14 Jul 2020.

Vancouver:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Jul 14]. 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 Illinois – Chicago

18. Cole, Samuel. An Iterative Spectral Approach to Recovering Planted Partitions.

Degree: 2018, University of Illinois – Chicago

 In the planted partition problem, the n vertices of a random graph are partitioned into k "clusters," and edges between vertices in the same cluster… (more)

Subjects/Keywords: Planted partition; Clustering; Random graphs; Spectral algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cole, S. (2018). An Iterative Spectral Approach to Recovering Planted Partitions. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22704

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):

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Thesis, University of Illinois – Chicago. Accessed July 14, 2020. http://hdl.handle.net/10027/22704.

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

MLA Handbook (7th Edition):

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Web. 14 Jul 2020.

Vancouver:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10027/22704.

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

Council of Science Editors:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22704

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


Virginia Tech

19. Parikh, Nidhi Kiranbhai. Generating Random Graphs with Tunable Clustering Coefficient.

Degree: MS, Computer Science, 2011, Virginia Tech

 Most real-world networks exhibit a high clustering coefficientâ the probability that two neighbors of a node are also neighbors of each other. We propose four… (more)

Subjects/Keywords: Clustering coefficient; complex networks; random graphs; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parikh, N. K. (2011). Generating Random Graphs with Tunable Clustering Coefficient. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31591

Chicago Manual of Style (16th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Masters Thesis, Virginia Tech. Accessed July 14, 2020. http://hdl.handle.net/10919/31591.

MLA Handbook (7th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Web. 14 Jul 2020.

Vancouver:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10919/31591.

Council of Science Editors:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/31591


Delft University of Technology

20. Van Dijk, L.A. (author). On the simplicity of configuration model random graphs.

Degree: 2011, Delft University of Technology

This thesis consits of a literature study and an investigation of a new problem. This new problem involves a generalization of the (random graph) configuration model, the so-called alternative model.

Probability theory

Applied mathematics

Electrical Engineering, Mathematics and Computer Science

Advisors/Committee Members: Hooghiemstra, G. (mentor).

Subjects/Keywords: Random Graphs; Configuration Model; Applied Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Dijk, L. A. (. (2011). On the simplicity of configuration model random graphs. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f

Chicago Manual of Style (16th Edition):

Van Dijk, L A (author). “On the simplicity of configuration model random graphs.” 2011. Masters Thesis, Delft University of Technology. Accessed July 14, 2020. http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f.

MLA Handbook (7th Edition):

Van Dijk, L A (author). “On the simplicity of configuration model random graphs.” 2011. Web. 14 Jul 2020.

Vancouver:

Van Dijk LA(. On the simplicity of configuration model random graphs. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2020 Jul 14]. Available from: http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f.

Council of Science Editors:

Van Dijk LA(. On the simplicity of configuration model random graphs. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f


Drexel University

21. Wildman, Jeffrey William, II. Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory.

Degree: 2015, Drexel University

The shared medium of wireless communication networks presents many technical challenges that offer a rich modeling and design space across both physical and scheduling protocol… (more)

Subjects/Keywords: Electrical engineering; Random graphs; Stochastic geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wildman, Jeffrey William, I. (2015). Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/idea:6399

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):

Wildman, Jeffrey William, II. “Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory.” 2015. Thesis, Drexel University. Accessed July 14, 2020. http://hdl.handle.net/1860/idea:6399.

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

MLA Handbook (7th Edition):

Wildman, Jeffrey William, II. “Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory.” 2015. Web. 14 Jul 2020.

Vancouver:

Wildman, Jeffrey William I. Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory. [Internet] [Thesis]. Drexel University; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1860/idea:6399.

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

Council of Science Editors:

Wildman, Jeffrey William I. Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory. [Thesis]. Drexel University; 2015. Available from: http://hdl.handle.net/1860/idea:6399

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

22. Asiri, Maha Mohammed. A transfer learning-based feature reduction method to improve classification accuracy.

Degree: 2017, NC Docks

 The need for efficient data use grows in machine learning algorithm for dataset with larger feature sets. Feature selection is the process of selecting minimum… (more)

Subjects/Keywords: Machine learning; Random graphs; Decision trees; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Asiri, M. M. (2017). A transfer learning-based feature reduction method to improve classification accuracy. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.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):

Asiri, Maha Mohammed. “A transfer learning-based feature reduction method to improve classification accuracy.” 2017. Thesis, NC Docks. Accessed July 14, 2020. http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf.

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

MLA Handbook (7th Edition):

Asiri, Maha Mohammed. “A transfer learning-based feature reduction method to improve classification accuracy.” 2017. Web. 14 Jul 2020.

Vancouver:

Asiri MM. A transfer learning-based feature reduction method to improve classification accuracy. [Internet] [Thesis]. NC Docks; 2017. [cited 2020 Jul 14]. Available from: http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf.

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

Council of Science Editors:

Asiri MM. A transfer learning-based feature reduction method to improve classification accuracy. [Thesis]. NC Docks; 2017. Available from: http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf

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


University of Waterloo

23. Graf, Alessandra. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.

Degree: 2016, University of Waterloo

 A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each pair of vertices u and… (more)

Subjects/Keywords: random graphs; directed graphs; strongly connected components; percolation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graf, A. (2016). On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10681

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):

Graf, Alessandra. “On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.” 2016. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/10681.

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

MLA Handbook (7th Edition):

Graf, Alessandra. “On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.” 2016. Web. 14 Jul 2020.

Vancouver:

Graf A. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/10681.

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

Council of Science Editors:

Graf A. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10681

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


Michigan Technological University

24. Kamischke, Ellen J. Benson's Theorem for Partial Geometries.

Degree: MS, Department of Mathematical Sciences, 2013, Michigan Technological University

  In 1970 Clark Benson published a theorem in the Journal of Algebra stating a congruence for generalized quadrangles. Since then this theorem has been… (more)

Subjects/Keywords: Benson's Theorem; partial geometry; strongly regular graphs; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamischke, E. J. (2013). Benson's Theorem for Partial Geometries. (Masters Thesis). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etds/690

Chicago Manual of Style (16th Edition):

Kamischke, Ellen J. “Benson's Theorem for Partial Geometries.” 2013. Masters Thesis, Michigan Technological University. Accessed July 14, 2020. http://digitalcommons.mtu.edu/etds/690.

MLA Handbook (7th Edition):

Kamischke, Ellen J. “Benson's Theorem for Partial Geometries.” 2013. Web. 14 Jul 2020.

Vancouver:

Kamischke EJ. Benson's Theorem for Partial Geometries. [Internet] [Masters thesis]. Michigan Technological University; 2013. [cited 2020 Jul 14]. Available from: http://digitalcommons.mtu.edu/etds/690.

Council of Science Editors:

Kamischke EJ. Benson's Theorem for Partial Geometries. [Masters Thesis]. Michigan Technological University; 2013. Available from: http://digitalcommons.mtu.edu/etds/690


University of St Andrews

25. Carey, Rachael Marie. Graph automatic semigroups.

Degree: PhD, 2016, University of St Andrews

 In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider… (more)

Subjects/Keywords: 512; Semigroups; Regular languages; QA182.C7; Cayley graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carey, R. M. (2016). Graph automatic semigroups. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/8645

Chicago Manual of Style (16th Edition):

Carey, Rachael Marie. “Graph automatic semigroups.” 2016. Doctoral Dissertation, University of St Andrews. Accessed July 14, 2020. http://hdl.handle.net/10023/8645.

MLA Handbook (7th Edition):

Carey, Rachael Marie. “Graph automatic semigroups.” 2016. Web. 14 Jul 2020.

Vancouver:

Carey RM. Graph automatic semigroups. [Internet] [Doctoral dissertation]. University of St Andrews; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10023/8645.

Council of Science Editors:

Carey RM. Graph automatic semigroups. [Doctoral Dissertation]. University of St Andrews; 2016. Available from: http://hdl.handle.net/10023/8645


University of Washington

26. Brito, Gerandy. Spectral analysis in bipartite biregular graphs and community detection.

Degree: PhD, 2017, University of Washington

 This thesis concerns to spectral gap of random regular graphs and consists of two main con- tributions. First, we prove that almost all bipartite biregular… (more)

Subjects/Keywords: community detection; regular graphs; spectral analysis; spectral gap; Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brito, G. (2017). Spectral analysis in bipartite biregular graphs and community detection. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/40636

Chicago Manual of Style (16th Edition):

Brito, Gerandy. “Spectral analysis in bipartite biregular graphs and community detection.” 2017. Doctoral Dissertation, University of Washington. Accessed July 14, 2020. http://hdl.handle.net/1773/40636.

MLA Handbook (7th Edition):

Brito, Gerandy. “Spectral analysis in bipartite biregular graphs and community detection.” 2017. Web. 14 Jul 2020.

Vancouver:

Brito G. Spectral analysis in bipartite biregular graphs and community detection. [Internet] [Doctoral dissertation]. University of Washington; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1773/40636.

Council of Science Editors:

Brito G. Spectral analysis in bipartite biregular graphs and community detection. [Doctoral Dissertation]. University of Washington; 2017. Available from: http://hdl.handle.net/1773/40636


University of Southern Mississippi

27. O'Rourke, Jonathan Lyons. Chromatic Thresholds of Regular Graphs with Small Cliques.

Degree: MS, Mathematics, 2014, University of Southern Mississippi

  The chromatic threshold of a class of graphs is the value θ such that any graph in this class with a minimum degree greater… (more)

Subjects/Keywords: chromatic number; chromatic threshold; graph theory; regular graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

O'Rourke, J. L. (2014). Chromatic Thresholds of Regular Graphs with Small Cliques. (Masters Thesis). University of Southern Mississippi. Retrieved from https://aquila.usm.edu/masters_theses/27

Chicago Manual of Style (16th Edition):

O'Rourke, Jonathan Lyons. “Chromatic Thresholds of Regular Graphs with Small Cliques.” 2014. Masters Thesis, University of Southern Mississippi. Accessed July 14, 2020. https://aquila.usm.edu/masters_theses/27.

MLA Handbook (7th Edition):

O'Rourke, Jonathan Lyons. “Chromatic Thresholds of Regular Graphs with Small Cliques.” 2014. Web. 14 Jul 2020.

Vancouver:

O'Rourke JL. Chromatic Thresholds of Regular Graphs with Small Cliques. [Internet] [Masters thesis]. University of Southern Mississippi; 2014. [cited 2020 Jul 14]. Available from: https://aquila.usm.edu/masters_theses/27.

Council of Science Editors:

O'Rourke JL. Chromatic Thresholds of Regular Graphs with Small Cliques. [Masters Thesis]. University of Southern Mississippi; 2014. Available from: https://aquila.usm.edu/masters_theses/27

28. Vanhove, Frédéric. Incidence geometry from an algebraic graph theory point of view.

Degree: 2011, Ghent University

 The goal of this thesis is to apply techniques from algebraic graph theory to finite incidence geometry. The incidence geometries under consideration include projective spaces,… (more)

Subjects/Keywords: Mathematics and Statistics; finite geometry; distance-regular graphs; association schemes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vanhove, F. (2011). Incidence geometry from an algebraic graph theory point of view. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1209078

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):

Vanhove, Frédéric. “Incidence geometry from an algebraic graph theory point of view.” 2011. Thesis, Ghent University. Accessed July 14, 2020. http://hdl.handle.net/1854/LU-1209078.

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

MLA Handbook (7th Edition):

Vanhove, Frédéric. “Incidence geometry from an algebraic graph theory point of view.” 2011. Web. 14 Jul 2020.

Vancouver:

Vanhove F. Incidence geometry from an algebraic graph theory point of view. [Internet] [Thesis]. Ghent University; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1854/LU-1209078.

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

Council of Science Editors:

Vanhove F. Incidence geometry from an algebraic graph theory point of view. [Thesis]. Ghent University; 2011. Available from: http://hdl.handle.net/1854/LU-1209078

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


University of St Andrews

29. McPhee, Jillian Dawn. Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures.

Degree: PhD, 2012, University of St Andrews

 Let Ω be the Fraïssé limit of a class of relational structures. We seek to answer the following semigroup theoretic question about Ω. What are… (more)

Subjects/Keywords: Fraïssé limit; Relational structure; Algebraically closed; Green's relations; H-class; D-class; J-class; Semigroup; Maximal subgroups; Random graph; Random bipartite graph; Random tournament; Henson's graphs; Rationals; Endomorphism semigroup; Endomorphism monoid; Retracts; QA182.M7; Semigroups of endomorphisms; Semigroups; Maximal subgroups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McPhee, J. D. (2012). Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/3358

Chicago Manual of Style (16th Edition):

McPhee, Jillian Dawn. “Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures.” 2012. Doctoral Dissertation, University of St Andrews. Accessed July 14, 2020. http://hdl.handle.net/10023/3358.

MLA Handbook (7th Edition):

McPhee, Jillian Dawn. “Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures.” 2012. Web. 14 Jul 2020.

Vancouver:

McPhee JD. Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures. [Internet] [Doctoral dissertation]. University of St Andrews; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10023/3358.

Council of Science Editors:

McPhee JD. Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures. [Doctoral Dissertation]. University of St Andrews; 2012. Available from: http://hdl.handle.net/10023/3358


Harvard University

30. Huang, Jiaoyang. Spectral Statistics of Random d-Regular Graphs.

Degree: PhD, 2019, Harvard University

In this thesis we study the uniform random d-regular graphs on N vertices from a random matrix theory point of view. In the first part… (more)

Subjects/Keywords: sparse random graphs; random matrices; eigenvalue statistics; eigenvector statistics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, J. (2019). Spectral Statistics of Random d-Regular Graphs. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716

Chicago Manual of Style (16th Edition):

Huang, Jiaoyang. “Spectral Statistics of Random d-Regular Graphs.” 2019. Doctoral Dissertation, Harvard University. Accessed July 14, 2020. http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716.

MLA Handbook (7th Edition):

Huang, Jiaoyang. “Spectral Statistics of Random d-Regular Graphs.” 2019. Web. 14 Jul 2020.

Vancouver:

Huang J. Spectral Statistics of Random d-Regular Graphs. [Internet] [Doctoral dissertation]. Harvard University; 2019. [cited 2020 Jul 14]. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716.

Council of Science Editors:

Huang J. Spectral Statistics of Random d-Regular Graphs. [Doctoral Dissertation]. Harvard University; 2019. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716

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

.