Advanced search options

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

You searched for `subject:(Regular graph)`

.
Showing records 1 – 30 of
44 total matches.

▼ Search Limiters

East Tennessee State University

1.
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 August 03, 2020.
https://dc.etsu.edu/etd/2601.

MLA Handbook (7^{th} Edition):

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

Vancouver:

Samani F. On Properties of r_{w}-Regular Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2015. [cited 2020 Aug 03].
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

NSYSU

2. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Liang Y. Anti-magic labeling of graphs. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2020 Aug 03]. 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

3. 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

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

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

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

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. 03 Aug 2020.

Vancouver:

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

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

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

4.
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 August 03, 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. 03 Aug 2020.

Vancouver:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Internet] [Masters thesis]. University of Georgia; 2017. [cited 2020 Aug 03]. 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

University of Southern Mississippi

5.
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 August 03, 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. 03 Aug 2020.

Vancouver:

O'Rourke JL. Chromatic Thresholds of Regular Graphs with Small Cliques. [Internet] [Masters thesis]. University of Southern Mississippi; 2014. [cited 2020 Aug 03]. 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

6.
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 August 03, 2020. http://hdl.handle.net/10217/83754.

MLA Handbook (7^{th} Edition):

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

Vancouver:

Lane-Harvard E. New constructions of strongly regular graphs. [Internet] [Doctoral dissertation]. Colorado State University; 2007. [cited 2020 Aug 03]. 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

7. 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 August 03, 2020. http://hdl.handle.net/2134/12508.

MLA Handbook (7^{th} Edition):

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

Vancouver:

Kemp G. Algebra and geometry of Dirac's magnetic monopole. [Internet] [Doctoral dissertation]. Loughborough University; 2013. [cited 2020 Aug 03]. 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

8. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Wiselet D. A study on e cordial labelling of graphs;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Aug 03]. 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

University of Waterloo

9. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Rooney B. Spectral Aspects of Cocliques in Graphs. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Aug 03]. 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

10.
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 August 03, 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. 03 Aug 2020.

Vancouver:

Gosnell SL. A Characterization of Large (*t,r*)-Regular Graphs. [Internet] [Thesis]. East Tennessee State University; 2000. [cited 2020 Aug 03].
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 Delaware

11. 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 August 03, 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. 03 Aug 2020.

Vancouver:

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

12. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Neubert, Eric J J. Some results on partial difference sets and partial geometries. [Internet] [Masters thesis]. Michigan Technological University; 2019. [cited 2020 Aug 03]. 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

13. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Internet] [Thesis]. Boise State University; 2016. [cited 2020 Aug 03]. 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

14. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Mohr AT. Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2013. [cited 2020 Aug 03]. 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

15. 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 August 03, 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. 03 Aug 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 Aug 03]. 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

16. 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 August 03, 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. 03 Aug 2020.

Vancouver:

Koledin TD. Neke klase spektralno ograničenih grafova. [Internet] [Thesis]. Univerzitet u Beogradu; 2014. [cited 2020 Aug 03]. 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

17. Kaski, Petteri. Algorithms for Classification of Combinatorial Objects.

Degree: 2005, Helsinki University of Technology

URL: http://lib.tkk.fi/Diss/2005/isbn9512277271/

►

A recurrently occurring problem in combinatorics is the need to completely characterize a finite set of finite objects implicitly defined by a set of constraints.… (more)

Subjects/Keywords: classification algorithm; isomorphism; isomorph rejection; near-resolvable design; one-factorization; orderly algorithm; regular graph; resolvable design; Steiner triple system

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaski, P. (2005). Algorithms for Classification of Combinatorial Objects. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2005/isbn9512277271/

Not specified: Masters Thesis or Doctoral Dissertation

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

Kaski, Petteri. “Algorithms for Classification of Combinatorial Objects.” 2005. Thesis, Helsinki University of Technology. Accessed August 03, 2020. http://lib.tkk.fi/Diss/2005/isbn9512277271/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kaski, Petteri. “Algorithms for Classification of Combinatorial Objects.” 2005. Web. 03 Aug 2020.

Vancouver:

Kaski P. Algorithms for Classification of Combinatorial Objects. [Internet] [Thesis]. Helsinki University of Technology; 2005. [cited 2020 Aug 03]. Available from: http://lib.tkk.fi/Diss/2005/isbn9512277271/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaski P. Algorithms for Classification of Combinatorial Objects. [Thesis]. Helsinki University of Technology; 2005. Available from: http://lib.tkk.fi/Diss/2005/isbn9512277271/

Not specified: Masters Thesis or Doctoral Dissertation

University of Central Florida

18.
Macon, Lisa.
Almost *Regular* Graphs And Edge Face Colorings Of Plane Graphs.

Degree: 2009, University of Central Florida

URL: https://stars.library.ucf.edu/etd/3923

► *Regular* graphs are graphs in which all vertices have the same degree. Many properties of these graphs are known. Such graphs play an important role…
(more)

Subjects/Keywords: plane graphs; graph coloring; almost regular graphs; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Macon, L. (2009). Almost Regular Graphs And Edge Face Colorings Of Plane Graphs. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/3923

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

Macon, Lisa. “Almost Regular Graphs And Edge Face Colorings Of Plane Graphs.” 2009. Doctoral Dissertation, University of Central Florida. Accessed August 03, 2020. https://stars.library.ucf.edu/etd/3923.

MLA Handbook (7^{th} Edition):

Macon, Lisa. “Almost Regular Graphs And Edge Face Colorings Of Plane Graphs.” 2009. Web. 03 Aug 2020.

Vancouver:

Macon L. Almost Regular Graphs And Edge Face Colorings Of Plane Graphs. [Internet] [Doctoral dissertation]. University of Central Florida; 2009. [cited 2020 Aug 03]. Available from: https://stars.library.ucf.edu/etd/3923.

Council of Science Editors:

Macon L. Almost Regular Graphs And Edge Face Colorings Of Plane Graphs. [Doctoral Dissertation]. University of Central Florida; 2009. Available from: https://stars.library.ucf.edu/etd/3923

University of Illinois – Urbana-Champaign

19.
O, Suil.
Matchings, Connectivity, and Eigenvalues in *Regular* Graphs.

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

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

► We study extremal and structural problems in *regular* graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number…
(more)

Subjects/Keywords: Matching; Connectivity; Edge-connectivity; Eigenvalue; Regular graph; Postman; Path cover; Average (edge)-connectivity; Total Domination; Balloon; $r$-dynamic coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

O, S. (2011). Matchings, Connectivity, and Eigenvalues in Regular Graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26034

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

O, Suil. “Matchings, Connectivity, and Eigenvalues in Regular Graphs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 03, 2020. http://hdl.handle.net/2142/26034.

MLA Handbook (7^{th} Edition):

O, Suil. “Matchings, Connectivity, and Eigenvalues in Regular Graphs.” 2011. Web. 03 Aug 2020.

Vancouver:

O S. Matchings, Connectivity, and Eigenvalues in Regular Graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Aug 03]. Available from: http://hdl.handle.net/2142/26034.

Council of Science Editors:

O S. Matchings, Connectivity, and Eigenvalues in Regular Graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26034

20.
Mortada, Maidoun.
The b-chromatic number of *regular* graphs : Le nombre b-chromatique de graphe régulier.

Degree: Docteur es, Informatique, 2013, Université Claude Bernard – Lyon I

URL: http://www.theses.fr/2013LYO10116

►

Les deux problèmes majeurs considérés dans cette thèse : le b-coloration problème et le graphe emballage problème. 1. Le b-coloration problème : Une coloration des… (more)

Subjects/Keywords: Coloration de graphe; B-coloration; Nombre b-chromatique; Graphe régulier; Emballage de graphe; Emballage marqué de graphe; Graphe puissance; Arbre non-étoile; Graph coloring; B-coloring; B-chromatic number; Regular graph; Graph packing; Labeled packing of graph; Power graph; Non-star tree; 004.0151

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mortada, M. (2013). The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2013LYO10116

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

Mortada, Maidoun. “The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.” 2013. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 03, 2020. http://www.theses.fr/2013LYO10116.

MLA Handbook (7^{th} Edition):

Mortada, Maidoun. “The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.” 2013. Web. 03 Aug 2020.

Vancouver:

Mortada M. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2013. [cited 2020 Aug 03]. Available from: http://www.theses.fr/2013LYO10116.

Council of Science Editors:

Mortada M. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2013. Available from: http://www.theses.fr/2013LYO10116

21.
Pierron, Théo.
Induction Schemes : From Language Separation to *Graph* Colorings : Schémas d'induction : from languages separation to *graph* colorings.

Degree: Docteur es, Informatique, 2019, Bordeaux

URL: http://www.theses.fr/2019BORD0119

►

Cette thèse présente des résultats obtenus dans deux domaines : la théorie des langages, et la théorie des graphes. En théorie des langages, on s’intéresse… (more)

Subjects/Keywords: Coloration de graphe; Graphe planaire; Méthode de déchargement; Langage régulier; Séparation de langages; Graph coloring; Planar graph; Discharging method; Regular language; Languages separation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pierron, T. (2019). Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2019BORD0119

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

Pierron, Théo. “Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings.” 2019. Doctoral Dissertation, Bordeaux. Accessed August 03, 2020. http://www.theses.fr/2019BORD0119.

MLA Handbook (7^{th} Edition):

Pierron, Théo. “Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings.” 2019. Web. 03 Aug 2020.

Vancouver:

Pierron T. Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings. [Internet] [Doctoral dissertation]. Bordeaux; 2019. [cited 2020 Aug 03]. Available from: http://www.theses.fr/2019BORD0119.

Council of Science Editors:

Pierron T. Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings. [Doctoral Dissertation]. Bordeaux; 2019. Available from: http://www.theses.fr/2019BORD0119

ETH Zürich

22. 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 August 03, 2020. http://hdl.handle.net/20.500.11850/282692.

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Mahatma Gandhi University

23. Joseph, O C. Some problems in block designs and optimality criteria; -.

Degree: Statistics, 2013, Mahatma Gandhi University

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

►

Jacroux (1985) extended the definition of *Regular* *graph* (RG) designs of Mitchell and John (1976) to Semi-*regular* *graph* (SRG) designs, and studied the type 1…
(more)

Subjects/Keywords: Eand#8722; optimality.; Balanced Incomplete Block (BIB) Design; Symmetrical Balanced Incomplete Block (SBIB) Design; Semi-Regular Graph (SRG) Design; Regular Graph (RG) Design; Group Divisible (GD) Design; Dual Designs; Balanced Treatment Incomplete Block (BTIB) Design; Group Divisible Treatment (GDT) Design; Partially Efficiency Balanced (PEB) Design

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Joseph, O. C. (2013). Some problems in block designs and optimality criteria; -. (Thesis). Mahatma Gandhi University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/7128

Not specified: Masters Thesis or Doctoral Dissertation

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

Joseph, O C. “Some problems in block designs and optimality criteria; -.” 2013. Thesis, Mahatma Gandhi University. Accessed August 03, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/7128.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Joseph, O C. “Some problems in block designs and optimality criteria; -.” 2013. Web. 03 Aug 2020.

Vancouver:

Joseph OC. Some problems in block designs and optimality criteria; -. [Internet] [Thesis]. Mahatma Gandhi University; 2013. [cited 2020 Aug 03]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/7128.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Joseph OC. Some problems in block designs and optimality criteria; -. [Thesis]. Mahatma Gandhi University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/7128

Not specified: Masters Thesis or Doctoral Dissertation

24. 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 August 03, 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. 03 Aug 2020.

Vancouver:

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

25.
Burmeister, Jan.
The Structure and Properties of Clique Graphs of *Regular* Graphs.

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

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

► In the following thesis, the structure and properties of G and its clique *graph* cl_{t} (G) are analyzed for graphs G that are non-complete,…
(more)

Subjects/Keywords: clique graph; regular graph; line graph; degree difference; independence number; Other Mathematics; Physical Sciences and Mathematics

…3.14
3.15
3.16
3.17
Non-*regular* *graph* G = P6 and its clique *graph* cl2 (G) = P5… …Non-connected clique *graph* cl3 (G) of a *regular* *graph* G whose edges are not
all in… …to show that |I| = α(G) ≤ |G|
2 in a *regular* *graph* . .
Independence number of… …slightly irregular clique *graph* cl3 (G) . . . . . . . .
*Graph* Rk with *regular* subgraphs… …a path such that the first
vertex of the path corresponds to the last. A *regular* *graph* is…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Burmeister, J. (2014). The Structure and Properties of Clique Graphs of Regular Graphs. (Masters Thesis). University of Southern Mississippi. Retrieved from https://aquila.usm.edu/masters_theses/77

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

Burmeister, Jan. “The Structure and Properties of Clique Graphs of Regular Graphs.” 2014. Masters Thesis, University of Southern Mississippi. Accessed August 03, 2020. https://aquila.usm.edu/masters_theses/77.

MLA Handbook (7^{th} Edition):

Burmeister, Jan. “The Structure and Properties of Clique Graphs of Regular Graphs.” 2014. Web. 03 Aug 2020.

Vancouver:

Burmeister J. The Structure and Properties of Clique Graphs of Regular Graphs. [Internet] [Masters thesis]. University of Southern Mississippi; 2014. [cited 2020 Aug 03]. Available from: https://aquila.usm.edu/masters_theses/77.

Council of Science Editors:

Burmeister J. The Structure and Properties of Clique Graphs of Regular Graphs. [Masters Thesis]. University of Southern Mississippi; 2014. Available from: https://aquila.usm.edu/masters_theses/77

Universidade Presbiteriana Mackenzie

26.
Wander Lairson Costa.
Avanços no estudo de complexidade em linguagem *regular* de autômatos celulares elementares.

Degree: 2013, Universidade Presbiteriana Mackenzie

URL: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761

►

Autômatos celulares são sistemas totalmente discretos que agem localmente de forma simples e determinística, mas cujo comportamento global resultante pode ser extremamente complexo. O conjunto… (more)

Subjects/Keywords: comportamento limite; autômato celular elementar; linguagem regular; grafo de processo; autômato finito; matriz de adjacência, complexidade; elementary cellular automaton; limit behavior; regular language; finite automaton; process graph; adjacency matrix; complexity; ENGENHARIA ELETRICA

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Costa, W. L. (2013). Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares. (Thesis). Universidade Presbiteriana Mackenzie. Retrieved from http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761

Not specified: Masters Thesis or Doctoral Dissertation

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

Costa, Wander Lairson. “Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares.” 2013. Thesis, Universidade Presbiteriana Mackenzie. Accessed August 03, 2020. http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Costa, Wander Lairson. “Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares.” 2013. Web. 03 Aug 2020.

Vancouver:

Costa WL. Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares. [Internet] [Thesis]. Universidade Presbiteriana Mackenzie; 2013. [cited 2020 Aug 03]. Available from: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Costa WL. Avanços no estudo de complexidade em linguagem regular de autômatos celulares elementares. [Thesis]. Universidade Presbiteriana Mackenzie; 2013. Available from: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2761

Not specified: Masters Thesis or Doctoral Dissertation

27. Wagner, Andrew. On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry .

Degree: 2013, University of Ottawa

URL: http://hdl.handle.net/10393/30290

► In 1975, Sheehan conjectured that every simple 4-*regular* hamiltonian *graph* has a second Hamilton cycle. If Sheehan's Conjecture holds, then the result can be extended…
(more)

Subjects/Keywords: Hamilton cycle; regular graph; Sheehan's Conjecture; automorphism group

…x28;S)|.
Corollary 1.1.2. Let X[A, B] be a bipartite k-*regular* *graph*, for k… …but extends it to any *regular* *graph*
of odd degree. Due to the following theorem of… …*regular* *graph*. Then X can be
decomposed into edge-disjoint 2-factors.
Our proof will require the… …Theorem 1.2.1): Let X = (V, E) be a 2k-*regular* *graph* of order n.
Without loss of… …each have degree k as well. Therefore, X is a k-*regular*
bipartite *graph*. Repeated application…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wagner, A. (2013). On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/30290

Not specified: Masters Thesis or Doctoral Dissertation

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

Wagner, Andrew. “On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry .” 2013. Thesis, University of Ottawa. Accessed August 03, 2020. http://hdl.handle.net/10393/30290.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wagner, Andrew. “On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry .” 2013. Web. 03 Aug 2020.

Vancouver:

Wagner A. On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry . [Internet] [Thesis]. University of Ottawa; 2013. [cited 2020 Aug 03]. Available from: http://hdl.handle.net/10393/30290.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wagner A. On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry . [Thesis]. University of Ottawa; 2013. Available from: http://hdl.handle.net/10393/30290

Not specified: Masters Thesis or Doctoral Dissertation

28. RAJIV PANICKER. Approximate matching of complex structures.

Degree: 2004, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/14303

Subjects/Keywords: Approximate Pattern Matching; Graph Algorithms; Information Retrieval; Regular Expressions; Tree Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

PANICKER, R. (2004). Approximate matching of complex structures. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/14303

Not specified: Masters Thesis or Doctoral Dissertation

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

PANICKER, RAJIV. “Approximate matching of complex structures.” 2004. Thesis, National University of Singapore. Accessed August 03, 2020. http://scholarbank.nus.edu.sg/handle/10635/14303.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

PANICKER, RAJIV. “Approximate matching of complex structures.” 2004. Web. 03 Aug 2020.

Vancouver:

PANICKER R. Approximate matching of complex structures. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2020 Aug 03]. Available from: http://scholarbank.nus.edu.sg/handle/10635/14303.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

PANICKER R. Approximate matching of complex structures. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/14303

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

29.
Shoaran, Maryam.
Automata methods and techniques for *graph*-structured data.

Degree: Dept. of Computer Science, 2011, University of Victoria

URL: http://hdl.handle.net/1828/3249

► *Graph*-structured data (GSD) is a popular model to represent complex information in a wide variety of applications such as social networks, biological data management, digital…
(more)

Subjects/Keywords: Regular Path Queries (RPQs); Graph Data; Distributed Algorithm; Query Rewriting; Local RPQs; Certain Answers; XML; Schema Evolution; Streaming Data; Visibly Pushdown Automata (VPAs)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shoaran, M. (2011). Automata methods and techniques for graph-structured data. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3249

Not specified: Masters Thesis or Doctoral Dissertation

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

Shoaran, Maryam. “Automata methods and techniques for graph-structured data.” 2011. Thesis, University of Victoria. Accessed August 03, 2020. http://hdl.handle.net/1828/3249.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shoaran, Maryam. “Automata methods and techniques for graph-structured data.” 2011. Web. 03 Aug 2020.

Vancouver:

Shoaran M. Automata methods and techniques for graph-structured data. [Internet] [Thesis]. University of Victoria; 2011. [cited 2020 Aug 03]. Available from: http://hdl.handle.net/1828/3249.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shoaran M. Automata methods and techniques for graph-structured data. [Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3249

Not specified: Masters Thesis or Doctoral Dissertation

30. Koledin Tamara. Some classes of spectrally constrained graphs.

Degree: PhD, Mathematics, 2013, University of Belgrade

URL: http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079

► Spectral *graph* theory is a branch of mathematics that emerged more than sixty years ago, and since then has been continuously developing. Its importance is…
(more)

Subjects/Keywords: adjacency matrix; signless Laplace matrix; graph spectrum; signless Laplace spectrum; second largest eigenvalue; regular graph; bipartite graph; nested graph; balanced incomplete block design; partially balanced incomplete block design; matrica susedstva grafa; nenegativna Laplasova matrica grafa; spektar grafa; nenegativni Laplasov spektar grafa; druga sopstvena vrednost; regularan graf; bipartitni graf; ugnežđeni graf; uravnotežena nekompletna blok-šema; delimično uravnotežena nekompletna blok-šema

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tamara, K. (2013). Some classes of spectrally constrained graphs. (Doctoral Dissertation). University of Belgrade. Retrieved from http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079

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

Tamara, Koledin. “Some classes of spectrally constrained graphs.” 2013. Doctoral Dissertation, University of Belgrade. Accessed August 03, 2020. http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079.

MLA Handbook (7^{th} Edition):

Tamara, Koledin. “Some classes of spectrally constrained graphs.” 2013. Web. 03 Aug 2020.

Vancouver:

Tamara K. Some classes of spectrally constrained graphs. [Internet] [Doctoral dissertation]. University of Belgrade; 2013. [cited 2020 Aug 03]. Available from: http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079.

Council of Science Editors:

Tamara K. Some classes of spectrally constrained graphs. [Doctoral Dissertation]. University of Belgrade; 2013. Available from: http://dx.doi.org/10.2298/BG20130708KOLEDIN ; http://eteze.bg.ac.rs/application/showtheses?thesesId=752 ; https://fedorabg.bg.ac.rs/fedora/get/o:7048/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=44728079