Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Random Regular Graph RRG )`

.
Showing records 1 – 30 of
9485 total matches.

◁ [1] [2] [3] [4] [5] … [317] ▶

Search Limiters

Dates

- 2016 – 2020 (3442)
- 2011 – 2015 (3726)
- 2006 – 2010 (1684)
- 2001 – 2005 (504)
- 1996 – 2000 (162)
- 1991 – 1995 (134)
- 1986 – 1990 (99)
- 1981 – 1985 (74)
- 1976 – 1980 (37)
- 1971 – 1975 (38)

Universities

- Brno University of Technology (460)
- University of Waterloo (215)
- University of Illinois – Urbana-Champaign (170)
- University of Florida (168)
- Georgia Tech (166)
- Virginia Tech (141)
- NSYSU (137)
- ETH Zürich (134)
- Delft University of Technology (130)
- The Ohio State University (126)
- National University of Singapore (122)
- University of São Paulo (122)
- Texas A&M University (118)
- Indian Institute of Science (98)
- KTH (98)

Department

- Mathematics (396)
- Computer Science (339)
- Informatique (288)
- Electrical and Computer Engineering (162)
- Electrical Engineering (134)
- Statistics (132)
- Mathématiques (113)
- Mathematical Sciences (92)
- Computer Science and Engineering (78)
- Applied Mathematics (65)
- Mechanical Engineering (61)
- Physics (61)
- Mathematics and Statistics (49)
- Physique (45)
- Engineering (43)

Degrees

- PhD (2057)
- Docteur es (947)
- MS (875)
- Master (156)
- Mestrado (64)
- MA (48)
- MS(M.S.) (19)
- MAin Mathematics (17)
- MSc (17)
- MSin Engineering (12)
- MSs (12)
- Dissertation (10)

Levels

- doctoral (3701)
- masters (1490)
- thesis (174)
- doctor of philosophy ph.d. (29)
- 1 (10)

Languages

Country

- US (3509)
- France (947)
- Canada (885)
- Czech Republic (460)
- Sweden (436)
- Brazil (361)
- Australia (342)
- UK (324)
- Netherlands (262)
- Greece (233)
- India (220)
- South Africa (142)
- Taiwan (137)
- Switzerland (135)
- Singapore (124)

▼ Search Limiters

1. Sharma, Abhishek. High throughput path selection for unstructured data center networks.

Degree: MS, 0112, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/45451

► The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work…
(more)

Subjects/Keywords: Data Center; Multipath Transmission Control Protocol (MPTCP); Jellyfish; Shortest Paths; Disjoint Paths; Throughput; Random Regular Graph (RRG); Random Permutation Matrix; Switches; Servers; Ports; Network Density

…computed once the *random* *regular* *graph* and traffic matrix
has been constructed.
We tested and… …are all conducted on the Jellyfish topology. The topology
is essentially a *random* *regular*… …proposed solutions to the problem of
finding k-disjoint paths between two nodes in a *graph*. In… …Chapter 3
Simulation Setup
3.1
*Graph* construction
The experiments conducted in this paper… …*graph* constructed at the top-of-rack (ToR) switch layer. Each switch
consists of p…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sharma, A. (2013). High throughput path selection for unstructured data center networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45451

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/45451.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Web. 11 Jul 2020.

Vancouver:

Sharma A. High throughput path selection for unstructured data center networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/45451.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sharma A. High throughput path selection for unstructured data center networks. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45451

Not specified: Masters Thesis or Doctoral Dissertation

ETH Zürich

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

Degree: 2018, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/282692

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Kamčev N. Colourings of Graphs and Words. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Jul 11]. 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

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

Degree: 2018, University of Alicante

URL: http://hdl.handle.net/10045/98110

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 11 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

East Tennessee State University

4.
Samani, Franklina.
On Properties of r_{w}-*Regular* Graphs.

Degree: MS, Mathematical Sciences, 2015, East Tennessee State University

URL: https://dc.etsu.edu/etd/2601

► If every vertex in a *graph* G has the same degree, then the *graph* is called a *regular* *graph*. That is, if deg(v) =…
(more)

Subjects/Keywords: graph theory; weighted graph; aw-regular graph.; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Samani, F. (2015). On Properties of r_{w}-Regular Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2601

Chicago Manual of Style (16^{th} Edition):

Samani, Franklina. “On Properties of r_{w}-Regular Graphs.” 2015. Masters Thesis, East Tennessee State University. Accessed July 11, 2020.
https://dc.etsu.edu/etd/2601.

MLA Handbook (7^{th} Edition):

Samani, Franklina. “On Properties of r_{w}-Regular Graphs.” 2015. Web. 11 Jul 2020.

Vancouver:

Samani F. On Properties of r_{w}-Regular Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2015. [cited 2020 Jul 11].
Available from: https://dc.etsu.edu/etd/2601.

Council of Science Editors:

Samani F. On Properties of r_{w}-Regular Graphs. [Masters Thesis]. East Tennessee State University; 2015. Available from: https://dc.etsu.edu/etd/2601

Ryerson University

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

Degree: 2010, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 11 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

6. Delcourt, Michelle Jeannette. Viewing extremal and structural problems through a probabilistic lens.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97669

► This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the…
(more)

Subjects/Keywords: Small subgraph conditioning method; Random regular graph; Intersecting families; Star decomposition; Structural graph theory; Extremal combinatorcs

…*random* 4-*regular* *graph* on n vertices has an orientation with out-degrees 0 or 3
asymptotically… …Decompositions of *Random* *Regular* Graphs
As Barát and Thomassen [11] note, decompositions of… …with certain requirements. For instance, given a 4-*regular* planar
*graph* G, an orientation in… …asked if every 4-edge-connected, 4-*regular* *graph*
has an orientation with out-degrees 0 or 3… …Conjecture 3.1.7. Every 4-edge-connected, 4-*regular* planar *graph* has an orientation with out…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Delcourt, M. J. (2017). Viewing extremal and structural problems through a probabilistic lens. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97669

Chicago Manual of Style (16^{th} Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/97669.

MLA Handbook (7^{th} Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Web. 11 Jul 2020.

Vancouver:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/97669.

Council of Science Editors:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97669

NSYSU

7. Liang, Yu-Chang. Anti-magic labeling of graphs.

Degree: PhD, Applied Mathematics, 2014, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910

► An antimagic labeling of a *graph* G is a one-to-one correspondence between E(G) and {1, 2, . . . , |E|} such that for any…
(more)

Subjects/Keywords: regular graph; tree; anti-magic; Cartesian product graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liang, Y. (2014). Anti-magic labeling of graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910

Chicago Manual of Style (16^{th} Edition):

Liang, Yu-Chang. “Anti-magic labeling of graphs.” 2014. Doctoral Dissertation, NSYSU. Accessed July 11, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910.

MLA Handbook (7^{th} Edition):

Liang, Yu-Chang. “Anti-magic labeling of graphs.” 2014. Web. 11 Jul 2020.

Vancouver:

Liang Y. Anti-magic labeling of graphs. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2020 Jul 11]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910.

Council of Science Editors:

Liang Y. Anti-magic labeling of graphs. [Doctoral Dissertation]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910

University of Lund

8.
Ajazi, Fioralba.
* Random* geometric graphs and their applications in
neuronal modelling.

Degree: 2018, University of Lund

URL: https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf

► *Random* *graph* theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons…
(more)

Subjects/Keywords: Mathematics; Probability Theory and Statistics; random graph; Neural Network; Probability; Inhomogeneous random graph; random distance graph; random grown networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ajazi, F. (2018). Random geometric graphs and their applications in neuronal modelling. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf

Chicago Manual of Style (16^{th} Edition):

Ajazi, Fioralba. “Random geometric graphs and their applications in neuronal modelling.” 2018. Doctoral Dissertation, University of Lund. Accessed July 11, 2020. https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf.

MLA Handbook (7^{th} Edition):

Ajazi, Fioralba. “Random geometric graphs and their applications in neuronal modelling.” 2018. Web. 11 Jul 2020.

Vancouver:

Ajazi F. Random geometric graphs and their applications in neuronal modelling. [Internet] [Doctoral dissertation]. University of Lund; 2018. [cited 2020 Jul 11]. Available from: https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf.

Council of Science Editors:

Ajazi F. Random geometric graphs and their applications in neuronal modelling. [Doctoral Dissertation]. University of Lund; 2018. Available from: https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf

9. Eto, Hiroshi. Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ.

Degree: 博士（情報工学）, 2017, Kyushu Institute of Technology / 九州工業大学

URL: http://hdl.handle.net/10228/5721

九州工業大学博士学位論文 学位記番号:情工博甲第308号 学位授与年月日:平成28年3月25日

1 Introduction|2 Preliminaries|3 Regular Induced Subgraphs|4 Distance d independent set|5 Conclusion

平成27年度

Subjects/Keywords: Graph algorithm; Inapproximability; Regular induced subgraph; Distance-d independent set; Graph class

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Eto, H. (2017). Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ. (Thesis). Kyushu Institute of Technology / 九州工業大学. Retrieved from http://hdl.handle.net/10228/5721

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Eto, Hiroshi. “Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ.” 2017. Thesis, Kyushu Institute of Technology / 九州工業大学. Accessed July 11, 2020. http://hdl.handle.net/10228/5721.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Eto, Hiroshi. “Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ.” 2017. Web. 11 Jul 2020.

Vancouver:

Eto H. Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ. [Internet] [Thesis]. Kyushu Institute of Technology / 九州工業大学; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10228/5721.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Eto H. Complexity of Finding Subgraphs with Prescribed Degrees and Pairwise-Distances : 次数と距離を指定した部分グラフ探索問題の計算複雑さ. [Thesis]. Kyushu Institute of Technology / 九州工業大学; 2017. Available from: http://hdl.handle.net/10228/5721

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

10.
Kalimurthy, Aravind.
Adapting *graph* simulation algorithms for *graph* database query processing.

Degree: MS, Computer Science, 2017, University of Georgia

URL: http://hdl.handle.net/10724/37802

► With data exponentially increasing in almost all fields in today’s world, there comes the necessity of handling and querying the data efficiently. Recently, many *graph*…
(more)

Subjects/Keywords: Graph Database; Graph Simulation Algorithms; Edge Label; Cardinality; Query Processing; Widcard; Regular Expression

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kalimurthy, A. (2017). Adapting graph simulation algorithms for graph database query processing. (Masters Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/37802

Chicago Manual of Style (16^{th} Edition):

Kalimurthy, Aravind. “Adapting graph simulation algorithms for graph database query processing.” 2017. Masters Thesis, University of Georgia. Accessed July 11, 2020. http://hdl.handle.net/10724/37802.

MLA Handbook (7^{th} Edition):

Kalimurthy, Aravind. “Adapting graph simulation algorithms for graph database query processing.” 2017. Web. 11 Jul 2020.

Vancouver:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Internet] [Masters thesis]. University of Georgia; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10724/37802.

Council of Science Editors:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Masters Thesis]. University of Georgia; 2017. Available from: http://hdl.handle.net/10724/37802

Temple University

11.
Kong, Nayeong.
Convergence Rates of Spectral Distribution of *Random* Inner Product Kernel Matrices.

Degree: PhD, 2018, Temple University

URL: http://digital.library.temple.edu/u?/p245801coll10,498132

►

Mathematics

This dissertation has two parts. In the first part, we focus on *random* inner product kernel matrices. Under various assumptions, many authors have proved…
(more)

Subjects/Keywords: Mathematics;

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kong, N. (2018). Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,498132

Chicago Manual of Style (16^{th} Edition):

Kong, Nayeong. “Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices.” 2018. Doctoral Dissertation, Temple University. Accessed July 11, 2020. http://digital.library.temple.edu/u?/p245801coll10,498132.

MLA Handbook (7^{th} Edition):

Kong, Nayeong. “Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices.” 2018. Web. 11 Jul 2020.

Vancouver:

Kong N. Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices. [Internet] [Doctoral dissertation]. Temple University; 2018. [cited 2020 Jul 11]. Available from: http://digital.library.temple.edu/u?/p245801coll10,498132.

Council of Science Editors:

Kong N. Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices. [Doctoral Dissertation]. Temple University; 2018. Available from: http://digital.library.temple.edu/u?/p245801coll10,498132

University of Southern Mississippi

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

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

URL: https://aquila.usm.edu/masters_theses/27

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

O'Rourke, Jonathan Lyons. “Chromatic Thresholds of Regular Graphs with Small Cliques.” 2014. Web. 11 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 11]. 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

Colorado State University

13.
Lane-Harvard, Elizabeth.
New constructions of strongly *regular* graphs.

Degree: PhD, Mathematics, 2007, Colorado State University

URL: http://hdl.handle.net/10217/83754

► There are many open problems concerning strongly *regular* graphs: proving non-existence for parameters where none are known; proving existence for parameters where none are known;…
(more)

Subjects/Keywords: generalized quadrangle; strongly regular graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lane-Harvard, E. (2007). New constructions of strongly regular graphs. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/83754

Chicago Manual of Style (16^{th} Edition):

Lane-Harvard, Elizabeth. “New constructions of strongly regular graphs.” 2007. Doctoral Dissertation, Colorado State University. Accessed July 11, 2020. http://hdl.handle.net/10217/83754.

MLA Handbook (7^{th} Edition):

Lane-Harvard, Elizabeth. “New constructions of strongly regular graphs.” 2007. Web. 11 Jul 2020.

Vancouver:

Lane-Harvard E. New constructions of strongly regular graphs. [Internet] [Doctoral dissertation]. Colorado State University; 2007. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10217/83754.

Council of Science Editors:

Lane-Harvard E. New constructions of strongly regular graphs. [Doctoral Dissertation]. Colorado State University; 2007. Available from: http://hdl.handle.net/10217/83754

Loughborough University

14. Kemp, Graham. Algebra and geometry of Dirac's magnetic monopole.

Degree: PhD, 2013, Loughborough University

URL: http://hdl.handle.net/2134/12508

► This thesis is concerned with the quantum Dirac magnetic monopole and two classes of its generalisations. The first of these are certain analogues of the…
(more)

Subjects/Keywords: 530.15; Magnetic monopole; Induced representation; Coadjoint orbit; Regular graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kemp, G. (2013). Algebra and geometry of Dirac's magnetic monopole. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/12508

Chicago Manual of Style (16^{th} Edition):

Kemp, Graham. “Algebra and geometry of Dirac's magnetic monopole.” 2013. Doctoral Dissertation, Loughborough University. Accessed July 11, 2020. http://hdl.handle.net/2134/12508.

MLA Handbook (7^{th} Edition):

Kemp, Graham. “Algebra and geometry of Dirac's magnetic monopole.” 2013. Web. 11 Jul 2020.

Vancouver:

Kemp G. Algebra and geometry of Dirac's magnetic monopole. [Internet] [Doctoral dissertation]. Loughborough University; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2134/12508.

Council of Science Editors:

Kemp G. Algebra and geometry of Dirac's magnetic monopole. [Doctoral Dissertation]. Loughborough University; 2013. Available from: http://hdl.handle.net/2134/12508

University of Waterloo

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

Degree: 2013, University of Waterloo

URL: http://hdl.handle.net/10012/7787

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Web. 11 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

16. Petti, Samantha N. Randomness as a tool for modeling and uncovering structure.

Degree: PhD, Mathematics, 2020, Georgia Tech

URL: http://hdl.handle.net/1853/62767

► This thesis contains four main research directions, united by the themes of using randomness to (i) construct structure and (ii) uncover structure. Randomness has long…
(more)

Subjects/Keywords: Random processes; Stochastic process; graph; hard sphere

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Petti, S. N. (2020). Randomness as a tool for modeling and uncovering structure. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62767

Chicago Manual of Style (16^{th} Edition):

Petti, Samantha N. “Randomness as a tool for modeling and uncovering structure.” 2020. Doctoral Dissertation, Georgia Tech. Accessed July 11, 2020. http://hdl.handle.net/1853/62767.

MLA Handbook (7^{th} Edition):

Petti, Samantha N. “Randomness as a tool for modeling and uncovering structure.” 2020. Web. 11 Jul 2020.

Vancouver:

Petti SN. Randomness as a tool for modeling and uncovering structure. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1853/62767.

Council of Science Editors:

Petti SN. Randomness as a tool for modeling and uncovering structure. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62767

17. Wiselet, D. A study on e cordial labelling of graphs;.

Degree: 2014, Manonmaniam Sundaranar University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26791

newline

Subjects/Keywords: bipartite graph; ECordial; Graphs; Regular graph; Wheel graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wiselet, D. (2014). A study on e cordial labelling of graphs;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26791

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wiselet, D. “A study on e cordial labelling of graphs;.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed July 11, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/26791.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wiselet, D. “A study on e cordial labelling of graphs;.” 2014. Web. 11 Jul 2020.

Vancouver:

Wiselet D. A study on e cordial labelling of graphs;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Jul 11]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26791.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wiselet D. A study on e cordial labelling of graphs;. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26791

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

18.
van Schetsen, Anouk (author).
Impact of *graph*-based features on Bitcoin prices.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:363d443c-64f6-4c35-9671-4092aa334923

►

Predicting the trends in Bitcoin market prices is a very challenging task due to the many uncertainties and variables influencing the market value. The market… (more)

Subjects/Keywords: Machine Learning; Random Forest; Bitcoin; random walk; graph analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

van Schetsen, A. (. (2019). Impact of graph-based features on Bitcoin prices. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:363d443c-64f6-4c35-9671-4092aa334923

Chicago Manual of Style (16^{th} Edition):

van Schetsen, Anouk (author). “Impact of graph-based features on Bitcoin prices.” 2019. Masters Thesis, Delft University of Technology. Accessed July 11, 2020. http://resolver.tudelft.nl/uuid:363d443c-64f6-4c35-9671-4092aa334923.

MLA Handbook (7^{th} Edition):

van Schetsen, Anouk (author). “Impact of graph-based features on Bitcoin prices.” 2019. Web. 11 Jul 2020.

Vancouver:

van Schetsen A(. Impact of graph-based features on Bitcoin prices. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Jul 11]. Available from: http://resolver.tudelft.nl/uuid:363d443c-64f6-4c35-9671-4092aa334923.

Council of Science Editors:

van Schetsen A(. Impact of graph-based features on Bitcoin prices. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:363d443c-64f6-4c35-9671-4092aa334923

Ryerson University

19. Haidar, Ali. The CC-Game: A Variant Of The Game Of Cops And Robbers.

Degree: 2012, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

► Cops and Robbers is a vertex pursuit game played on graphs. The objective of the game, as the name suggests, is for a set of…
(more)

Subjects/Keywords: Graph theory – Data processing; Random graphs; Graph algorithms; Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Haidar, A. (2012). The CC-Game: A Variant Of The Game Of Cops And Robbers. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Haidar, Ali. “The CC-Game: A Variant Of The Game Of Cops And Robbers.” 2012. Thesis, Ryerson University. Accessed July 11, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1866.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Haidar, Ali. “The CC-Game: A Variant Of The Game Of Cops And Robbers.” 2012. Web. 11 Jul 2020.

Vancouver:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Internet] [Thesis]. Ryerson University; 2012. [cited 2020 Jul 11]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Thesis]. Ryerson University; 2012. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

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

Degree: 2014, University of Waterloo

URL: http://hdl.handle.net/10012/8409

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

East Tennessee State University

21.
Gosnell, Shannon Leah.
A Characterization of Large (*t,r*)-*Regular* Graphs.

Degree: MS, Mathematical Sciences, 2000, East Tennessee State University

URL: https://dc.etsu.edu/etd/7

► A *graph* G is a (t,r)-*regular* *graph* if every collection of t independent vertices is collectively adjacent to exactly r vertices. In this thesis,…
(more)

Subjects/Keywords: graph theory; regular; (t r)-regular; r-regular; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gosnell, S. L. (2000). A Characterization of Large (*t,r*)-Regular Graphs. (Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/7

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gosnell, Shannon Leah. “A Characterization of Large (*t,r*)-Regular Graphs.” 2000. Thesis, East Tennessee State University. Accessed July 11, 2020.
https://dc.etsu.edu/etd/7.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gosnell, Shannon Leah. “A Characterization of Large (*t,r*)-Regular Graphs.” 2000. Web. 11 Jul 2020.

Vancouver:

Gosnell SL. A Characterization of Large (*t,r*)-Regular Graphs. [Internet] [Thesis]. East Tennessee State University; 2000. [cited 2020 Jul 11].
Available from: https://dc.etsu.edu/etd/7.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gosnell SL. A Characterization of Large (*t,r*)-Regular Graphs. [Thesis]. East Tennessee State University; 2000. Available from: https://dc.etsu.edu/etd/7

Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

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

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

URL: https://scholarcommons.sc.edu/etd/3697

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

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

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Web. 11 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 11]. 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

University of Delaware

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

Degree: 2018, University of Delaware

URL: http://udspace.udel.edu/handle/19716/23728

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

McGinnis M. Combinatorial and spectral properties of graphs and association schemes . [Internet] [Doctoral dissertation]. University of Delaware; 2018. [cited 2020 Jul 11]. 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

Michigan Technological University

24. Neubert, Eric J, Jr. Some results on partial difference sets and partial geometries.

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

URL: https://digitalcommons.mtu.edu/etdr/820

► This thesis shows results on 3 different problems involving partial difference sets (PDS) in abelian groups, and uses PDS to study partial geometries with…
(more)

Subjects/Keywords: partial difference set; partial geometry; strongly regular graph; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Neubert, Eric J, J. (2019). Some results on partial difference sets and partial geometries. (Masters Thesis). Michigan Technological University. Retrieved from https://digitalcommons.mtu.edu/etdr/820

Chicago Manual of Style (16^{th} Edition):

Neubert, Eric J, Jr. “Some results on partial difference sets and partial geometries.” 2019. Masters Thesis, Michigan Technological University. Accessed July 11, 2020. https://digitalcommons.mtu.edu/etdr/820.

MLA Handbook (7^{th} Edition):

Neubert, Eric J, Jr. “Some results on partial difference sets and partial geometries.” 2019. Web. 11 Jul 2020.

Vancouver:

Neubert, Eric J J. Some results on partial difference sets and partial geometries. [Internet] [Masters thesis]. Michigan Technological University; 2019. [cited 2020 Jul 11]. Available from: https://digitalcommons.mtu.edu/etdr/820.

Council of Science Editors:

Neubert, Eric J J. Some results on partial difference sets and partial geometries. [Masters Thesis]. Michigan Technological University; 2019. Available from: https://digitalcommons.mtu.edu/etdr/820

Boise State University

25. Beserra, Kyle Douglas. On the Conjugacy Problem for Automorphisms of Trees.

Degree: 2016, Boise State University

URL: https://scholarworks.boisestate.edu/td/1083

► In this thesis we identify the complexity of the conjugacy problem of automorphisms of *regular* trees. We expand on the results of Kechris, Louveau, and…
(more)

Subjects/Keywords: invariant descriptive set theory; borel reducibility; graph theory; regular trees; Logic and Foundations; Set Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Beserra, K. D. (2016). On the Conjugacy Problem for Automorphisms of Trees. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1083

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Beserra, Kyle Douglas. “On the Conjugacy Problem for Automorphisms of Trees.” 2016. Thesis, Boise State University. Accessed July 11, 2020. https://scholarworks.boisestate.edu/td/1083.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Beserra, Kyle Douglas. “On the Conjugacy Problem for Automorphisms of Trees.” 2016. Web. 11 Jul 2020.

Vancouver:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Internet] [Thesis]. Boise State University; 2016. [cited 2020 Jul 11]. Available from: https://scholarworks.boisestate.edu/td/1083.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Thesis]. Boise State University; 2016. Available from: https://scholarworks.boisestate.edu/td/1083

Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

26. Mohr, Austin Tyler. Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs.

Degree: PhD, Mathematics, 2013, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/1606

► The Lovász local lemma is a powerful and well-studied probabilistic technique useful in establishing the possibility of simultaneously avoiding every event in some collection.…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; configuration model; conflict graph; lopsided local lemma; Lovasz local lemma; negative dependency graph; regular uniform hypergraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mohr, A. T. (2013). Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/1606

Chicago Manual of Style (16^{th} Edition):

Mohr, Austin Tyler. “Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs.” 2013. Doctoral Dissertation, University of South Carolina. Accessed July 11, 2020. https://scholarcommons.sc.edu/etd/1606.

MLA Handbook (7^{th} Edition):

Mohr, Austin Tyler. “Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs.” 2013. Web. 11 Jul 2020.

Vancouver:

Mohr AT. Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2013. [cited 2020 Jul 11]. Available from: https://scholarcommons.sc.edu/etd/1606.

Council of Science Editors:

Mohr AT. Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs. [Doctoral Dissertation]. University of South Carolina; 2013. Available from: https://scholarcommons.sc.edu/etd/1606

27. Prašnički, Lidija. Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč.

Degree: 2015, Univerza v Mariboru

URL: https://dk.um.si/IzpisGradiva.php?id=47567 ; https://dk.um.si/Dokument.php?id=70599&dn= ; https://plus.si.cobiss.net/opac7/bib/21251592?lang=sl

►

V magistrskem delu je obravnavano celotno kromatično število regularnih grafov z visoko stopnjo vozlišč. Celotno kromatično število grafa je najmanjše število barv, ki jih potrebujemo,… (more)

Subjects/Keywords: celotno kromatično število; regularni graf; prirejanje grafa; the total chromatic number; regular graph; graph matching; info:eu-repo/classification/udc/519.17(043.2)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Prašnički, L. (2015). Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=47567 ; https://dk.um.si/Dokument.php?id=70599&dn= ; https://plus.si.cobiss.net/opac7/bib/21251592?lang=sl

Chicago Manual of Style (16^{th} Edition):

Prašnički, Lidija. “Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč.” 2015. Masters Thesis, Univerza v Mariboru. Accessed July 11, 2020. https://dk.um.si/IzpisGradiva.php?id=47567 ; https://dk.um.si/Dokument.php?id=70599&dn= ; https://plus.si.cobiss.net/opac7/bib/21251592?lang=sl.

MLA Handbook (7^{th} Edition):

Prašnički, Lidija. “Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč.” 2015. Web. 11 Jul 2020.

Vancouver:

Prašnički L. Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč. [Internet] [Masters thesis]. Univerza v Mariboru; 2015. [cited 2020 Jul 11]. Available from: https://dk.um.si/IzpisGradiva.php?id=47567 ; https://dk.um.si/Dokument.php?id=70599&dn= ; https://plus.si.cobiss.net/opac7/bib/21251592?lang=sl.

Council of Science Editors:

Prašnički L. Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč. [Masters Thesis]. Univerza v Mariboru; 2015. Available from: https://dk.um.si/IzpisGradiva.php?id=47567 ; https://dk.um.si/Dokument.php?id=70599&dn= ; https://plus.si.cobiss.net/opac7/bib/21251592?lang=sl

Univerzitet u Beogradu

28. Koledin, Tamara D. Neke klase spektralno ograničenih grafova.

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

URL: https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get

►

Matematika-Algebarska teorija grafova / Mathematics-Algebraic *graph* theory

Spektralna teorija grafova je grana matematike koja je nastala pedesetih godina pro²log veka i od tada se neprestano… (more)

Subjects/Keywords: adjacency matrix; signless Laplace matrix; graph spectrum; signless La- place spectrum; second largest eigenvalue; regular graph; bipartite graph; nested graph; balanced incomplete block design; partially balanced incomplete block de- sign

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Koledin, T. D. (2014). Neke klase spektralno ograničenih grafova. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Koledin, Tamara D. “Neke klase spektralno ograničenih grafova.” 2014. Thesis, Univerzitet u Beogradu. Accessed July 11, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Koledin, Tamara D. “Neke klase spektralno ograničenih grafova.” 2014. Web. 11 Jul 2020.

Vancouver:

Koledin TD. Neke klase spektralno ograničenih grafova. [Internet] [Thesis]. Univerzitet u Beogradu; 2014. [cited 2020 Jul 11]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koledin TD. Neke klase spektralno ograničenih grafova. [Thesis]. Univerzitet u Beogradu; 2014. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

29.
Nath, Shuvra Kanti.
Multi-directional Rapidly Exploring *Random* *Graph* (mRRG) for Motion Planning.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151658

► The motion planning problem in robotics is to find a valid sequence of motions taking some movable object from a start configuration to a goal…
(more)

Subjects/Keywords: Motion Planning; RRT; RRG; Protein Folding

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nath, S. K. (2013). Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151658

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Nath, Shuvra Kanti. “Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning.” 2013. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/151658.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nath, Shuvra Kanti. “Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning.” 2013. Web. 11 Jul 2020.

Vancouver:

Nath SK. Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/151658.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nath SK. Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151658

Not specified: Masters Thesis or Doctoral Dissertation

30. F. Vitale. FAST LEARNING ON GRAPHS.

Degree: 2011, Università degli Studi di Milano

URL: http://hdl.handle.net/2434/155500

► We carry out a systematic study of classification problems on networked data, presenting novel techniques with good performance both in theory and in practice. We…
(more)

Subjects/Keywords: graph learning; graph prediction; graph theory; graph clustering; transductive learning; online learning; random spanning trees; random walks; node classification; effective resistance; Settore INF/01 - Informatica

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vitale, F. (2011). FAST LEARNING ON GRAPHS. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/155500

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Vitale, F.. “FAST LEARNING ON GRAPHS.” 2011. Thesis, Università degli Studi di Milano. Accessed July 11, 2020. http://hdl.handle.net/2434/155500.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vitale, F.. “FAST LEARNING ON GRAPHS.” 2011. Web. 11 Jul 2020.

Vancouver:

Vitale F. FAST LEARNING ON GRAPHS. [Internet] [Thesis]. Università degli Studi di Milano; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2434/155500.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vitale F. FAST LEARNING ON GRAPHS. [Thesis]. Università degli Studi di Milano; 2011. Available from: http://hdl.handle.net/2434/155500

Not specified: Masters Thesis or Doctoral Dissertation