Advanced search options

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

You searched for `subject:(Graphs Digraphs)`

.
Showing records 1 – 12 of
12 total matches.

▼ Search Limiters

1.
Jisha Elizabath Joy.
A study on topologies arising from *graphs* and
*digraphs*; -.

Degree: Mathematics, 2012, Kannur University

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

Subjects/Keywords: Graphs; digraphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Joy, J. E. (2012). A study on topologies arising from graphs and digraphs; -. (Thesis). Kannur University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/6059

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

Joy, Jisha Elizabath. “A study on topologies arising from graphs and digraphs; -.” 2012. Thesis, Kannur University. Accessed January 18, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/6059.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Joy, Jisha Elizabath. “A study on topologies arising from graphs and digraphs; -.” 2012. Web. 18 Jan 2020.

Vancouver:

Joy JE. A study on topologies arising from graphs and digraphs; -. [Internet] [Thesis]. Kannur University; 2012. [cited 2020 Jan 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/6059.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Joy JE. A study on topologies arising from graphs and digraphs; -. [Thesis]. Kannur University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/6059

Not specified: Masters Thesis or Doctoral Dissertation

Ohio University

2.
Jameel, Muhammad.
On unique realizability of *digraphs* and * graphs*.

Degree: PhD, Electrical Engineering & Computer Science (Engineering and Technology), 1982, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1171668980

On unique realizability of digraphs and
graphs
*Advisors/Committee Members: Chen, Wai-Kai (Advisor).*

Subjects/Keywords: digraphs; graphs; realizability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jameel, M. (1982). On unique realizability of digraphs and graphs. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1171668980

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

Jameel, Muhammad. “On unique realizability of digraphs and graphs.” 1982. Doctoral Dissertation, Ohio University. Accessed January 18, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1171668980.

MLA Handbook (7^{th} Edition):

Jameel, Muhammad. “On unique realizability of digraphs and graphs.” 1982. Web. 18 Jan 2020.

Vancouver:

Jameel M. On unique realizability of digraphs and graphs. [Internet] [Doctoral dissertation]. Ohio University; 1982. [cited 2020 Jan 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1171668980.

Council of Science Editors:

Jameel M. On unique realizability of digraphs and graphs. [Doctoral Dissertation]. Ohio University; 1982. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1171668980

3.
E.Bala.
A Study on Graph Labelings of Cayley *Digraphs* and Its
Competition *Graphs*; Nil.

Degree: A Study on Graph Labelings of Cayley, 2014, Mother Teresa Womens University

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

Subjects/Keywords: mathematics; graphs; cayley; digraphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

E.Bala. (2014). A Study on Graph Labelings of Cayley Digraphs and Its Competition Graphs; Nil. (Thesis). Mother Teresa Womens University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/18526

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

E.Bala. “A Study on Graph Labelings of Cayley Digraphs and Its Competition Graphs; Nil.” 2014. Thesis, Mother Teresa Womens University. Accessed January 18, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/18526.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

E.Bala. “A Study on Graph Labelings of Cayley Digraphs and Its Competition Graphs; Nil.” 2014. Web. 18 Jan 2020.

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

Author name may be incomplete

Vancouver:

E.Bala. A Study on Graph Labelings of Cayley Digraphs and Its Competition Graphs; Nil. [Internet] [Thesis]. Mother Teresa Womens University; 2014. [cited 2020 Jan 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/18526.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

E.Bala. A Study on Graph Labelings of Cayley Digraphs and Its Competition Graphs; Nil. [Thesis]. Mother Teresa Womens University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/18526

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

4.
Harutyunyan, Anna.
Maximum flow in planar * digraphs*.

Degree: MS, Computer Science, 2012, Oregon State University

URL: http://hdl.handle.net/1957/35602

► Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation,…
(more)

Subjects/Keywords: Planar digraphs; Directed graphs

…*graphs*, the ﬁrst strongly polynomial-time algorithm was developed in 1972
by Edmonds and Karp… …x5B;30], respec
tively. These bounds match O(nm) except for sparse *graphs*… …No better strongly poly
nomial algorithm for sparse *graphs* has been developed for 18 years… …n2 / log n) bound for sparse
*graphs* (m = O(n)).
Planar *graphs* are… …general graph families, such as *graphs* embeddable on boundedgenus surfaces, or *graphs* with…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harutyunyan, A. (2012). Maximum flow in planar digraphs. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/35602

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

Harutyunyan, Anna. “Maximum flow in planar digraphs.” 2012. Masters Thesis, Oregon State University. Accessed January 18, 2020. http://hdl.handle.net/1957/35602.

MLA Handbook (7^{th} Edition):

Harutyunyan, Anna. “Maximum flow in planar digraphs.” 2012. Web. 18 Jan 2020.

Vancouver:

Harutyunyan A. Maximum flow in planar digraphs. [Internet] [Masters thesis]. Oregon State University; 2012. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/1957/35602.

Council of Science Editors:

Harutyunyan A. Maximum flow in planar digraphs. [Masters Thesis]. Oregon State University; 2012. Available from: http://hdl.handle.net/1957/35602

Iowa State University

5.
Olmez, Oktay.
On highly regular * digraphs*.

Degree: 2012, Iowa State University

URL: https://lib.dr.iastate.edu/etd/12626

► We explore directed strongly regular *graphs* (DSRGs) and their connections to association schemes and finite incidence structures. More specically, we study flags and antiflags of…
(more)

Subjects/Keywords: Association Schemes; Directed strongly regular graphs; Finite incidence structures; Partial geometric designs; Transitive digraphs; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Olmez, O. (2012). On highly regular digraphs. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/12626

Not specified: Masters Thesis or Doctoral Dissertation

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

Olmez, Oktay. “On highly regular digraphs.” 2012. Thesis, Iowa State University. Accessed January 18, 2020. https://lib.dr.iastate.edu/etd/12626.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Olmez, Oktay. “On highly regular digraphs.” 2012. Web. 18 Jan 2020.

Vancouver:

Olmez O. On highly regular digraphs. [Internet] [Thesis]. Iowa State University; 2012. [cited 2020 Jan 18]. Available from: https://lib.dr.iastate.edu/etd/12626.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Olmez O. On highly regular digraphs. [Thesis]. Iowa State University; 2012. Available from: https://lib.dr.iastate.edu/etd/12626

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

6.
Jahanbekam, Sogol.
Extremal problems for labelling of *graphs* and distance in * digraphs*.

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

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

► We study several extremal problems in graph labelling and in weak diameter of *digraphs*. In Chapter 2 we apply the Discharging Method to prove the…
(more)

Subjects/Keywords: Graph Coloring; Graph Labelling; Ramsey Numbers; AntiRamsey Graph Theory; Weak Diameter in Digraphs; Matching in Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jahanbekam, S. (2013). Extremal problems for labelling of graphs and distance in digraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45527

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

Jahanbekam, Sogol. “Extremal problems for labelling of graphs and distance in digraphs.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 18, 2020. http://hdl.handle.net/2142/45527.

MLA Handbook (7^{th} Edition):

Jahanbekam, Sogol. “Extremal problems for labelling of graphs and distance in digraphs.” 2013. Web. 18 Jan 2020.

Vancouver:

Jahanbekam S. Extremal problems for labelling of graphs and distance in digraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/2142/45527.

Council of Science Editors:

Jahanbekam S. Extremal problems for labelling of graphs and distance in digraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45527

University of Vienna

7.
Marx, Christoph.
Highly arc transitive * digraphs*.

Degree: 2010, University of Vienna

URL: http://othes.univie.ac.at/10559/

►

Unendliche, hochgradig bogentransitive Digraphen werden definiert und anhand von Beispielen vorgestellt. Die Erreichbarkeitsrelation und Eigenschaft–Z werden definiert und unter Verwendung von Knotengraden, Wachstum und anderen… (more)

Subjects/Keywords: 31.12 Kombinatorik, Graphentheorie; Graphen / Digraphen / bogentransitiv / transitiv / Eigenschaft Z / Erreichbarkeitsrelation / Enden; graphs / digraphs / arc-transitive / transitive / Property Z / reachability relation / ends

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Marx, C. (2010). Highly arc transitive digraphs. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/10559/

Not specified: Masters Thesis or Doctoral Dissertation

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

Marx, Christoph. “Highly arc transitive digraphs.” 2010. Thesis, University of Vienna. Accessed January 18, 2020. http://othes.univie.ac.at/10559/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Marx, Christoph. “Highly arc transitive digraphs.” 2010. Web. 18 Jan 2020.

Vancouver:

Marx C. Highly arc transitive digraphs. [Internet] [Thesis]. University of Vienna; 2010. [cited 2020 Jan 18]. Available from: http://othes.univie.ac.at/10559/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marx C. Highly arc transitive digraphs. [Thesis]. University of Vienna; 2010. Available from: http://othes.univie.ac.at/10559/

Not specified: Masters Thesis or Doctoral Dissertation

8.
Ancykutty, Joseph; Dr.Krishnamoorthy,A.
On infinite *graphs* and related matrices.

Degree: mathematics, 2000, Cochin University of Science and Technology

URL: http://dyuthi.cusat.ac.in/purl/3142

►

This thesis Entitled On Infinite *graphs* and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any…
(more)

Subjects/Keywords: Graphs and Digraphs; Theory of rings; Adjacency matrix,; Infinite digraph; Arc adjacency operator

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ancykutty, J. D. K. (2000). On infinite graphs and related matrices. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/3142

Not specified: Masters Thesis or Doctoral Dissertation

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

Ancykutty, Joseph; Dr Krishnamoorthy,A. “On infinite graphs and related matrices.” 2000. Thesis, Cochin University of Science and Technology. Accessed January 18, 2020. http://dyuthi.cusat.ac.in/purl/3142.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ancykutty, Joseph; Dr Krishnamoorthy,A. “On infinite graphs and related matrices.” 2000. Web. 18 Jan 2020.

Vancouver:

Ancykutty JDK. On infinite graphs and related matrices. [Internet] [Thesis]. Cochin University of Science and Technology; 2000. [cited 2020 Jan 18]. Available from: http://dyuthi.cusat.ac.in/purl/3142.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ancykutty JDK. On infinite graphs and related matrices. [Thesis]. Cochin University of Science and Technology; 2000. Available from: http://dyuthi.cusat.ac.in/purl/3142

Not specified: Masters Thesis or Doctoral Dissertation

Texas State University – San Marcos

9.
Conrad, Esther D.
Zero Forcing in *Graphs* and * Digraphs*.

Degree: MS, Applied Mathematics, 2018, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/7420

No abstract prepared.
*Advisors/Committee Members: Ferrero, Daniela (advisor), Barrera, Roberto (committee member), Shen, Jian (committee member).*

Subjects/Keywords: Zero Forcing; Graph Theory; Graphs Digraphs; Graph theory; Mathematics – Charts, diagrams, etc.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Conrad, E. D. (2018). Zero Forcing in Graphs and Digraphs. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/7420

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

Conrad, Esther D. “Zero Forcing in Graphs and Digraphs.” 2018. Masters Thesis, Texas State University – San Marcos. Accessed January 18, 2020. https://digital.library.txstate.edu/handle/10877/7420.

MLA Handbook (7^{th} Edition):

Conrad, Esther D. “Zero Forcing in Graphs and Digraphs.” 2018. Web. 18 Jan 2020.

Vancouver:

Conrad ED. Zero Forcing in Graphs and Digraphs. [Internet] [Masters thesis]. Texas State University – San Marcos; 2018. [cited 2020 Jan 18]. Available from: https://digital.library.txstate.edu/handle/10877/7420.

Council of Science Editors:

Conrad ED. Zero Forcing in Graphs and Digraphs. [Masters Thesis]. Texas State University – San Marcos; 2018. Available from: https://digital.library.txstate.edu/handle/10877/7420

10. Knapp, Christopher N. The complexity of greedoid Tutte polynomials.

Degree: PhD, 2018, Brunel University

URL: http://bura.brunel.ac.uk/handle/2438/15891 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764953

► We consider the computational complexity of evaluating the Tutte polynomial of three particular classes of greedoid, namely rooted *graphs*, rooted *digraphs* and binary greedoids. Furthermore…
(more)

Subjects/Keywords: Rooted graphs; Rooted digraphs; Binary greedoids; Algorithm; Matroids

…x29; = 1 for all e ∈ E(G). We do
not restrict ourselves to simple *graphs* unless… …An isomorphism of *graphs* G and G′ is a bijection f : V (G) → V (G′ )… …exists between two *graphs* G and G′ then they are said to be
isomorphic to one another and we… …the notion of the rank function from *graphs* to matroids as follows. Given a
matroid M… …x29; + rM (E − A), a result proved in
[62].
1.3
Rooted *Graphs*, Rooted…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Knapp, C. N. (2018). The complexity of greedoid Tutte polynomials. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/15891 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764953

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

Knapp, Christopher N. “The complexity of greedoid Tutte polynomials.” 2018. Doctoral Dissertation, Brunel University. Accessed January 18, 2020. http://bura.brunel.ac.uk/handle/2438/15891 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764953.

MLA Handbook (7^{th} Edition):

Knapp, Christopher N. “The complexity of greedoid Tutte polynomials.” 2018. Web. 18 Jan 2020.

Vancouver:

Knapp CN. The complexity of greedoid Tutte polynomials. [Internet] [Doctoral dissertation]. Brunel University; 2018. [cited 2020 Jan 18]. Available from: http://bura.brunel.ac.uk/handle/2438/15891 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764953.

Council of Science Editors:

Knapp CN. The complexity of greedoid Tutte polynomials. [Doctoral Dissertation]. Brunel University; 2018. Available from: http://bura.brunel.ac.uk/handle/2438/15891 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764953

11.
Maheswari,V.
Studies in graph theory decomposition of *graphs* into
paths and trees;.

Degree: 2014, Manonmaniam Sundaranar University

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

Subjects/Keywords: cycles of uniform; decomposition of graphs; graphs and digraphs; graph theory; paths and trees

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maheswari,V. (2014). Studies in graph theory decomposition of graphs into paths and trees;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/19721

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

Maheswari,V. “Studies in graph theory decomposition of graphs into paths and trees;.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed January 18, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/19721.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Maheswari,V. “Studies in graph theory decomposition of graphs into paths and trees;.” 2014. Web. 18 Jan 2020.

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

Author name may be incomplete

Vancouver:

Maheswari,V. Studies in graph theory decomposition of graphs into paths and trees;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Jan 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/19721.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maheswari,V. Studies in graph theory decomposition of graphs into paths and trees;. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/19721

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

12.
Peterson, Nicholas Richard.
On Random k-Out *Graphs* with Preferential Attachment.

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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839

► In a series of papers, Hansen and Jaworski explored a very general model for choosing random mappings with exchangeable in-degrees. The special case in which…
(more)

Subjects/Keywords: Mathematics; Combinatorial probability; random graphs; random mappings; Hansen and Jaworski; digraphs; functional digraph; vertex connectivity; minimum vertex degree; k-core; total variation distance

…has several complications not present in more classical models of
random *graphs*, *digraphs*… …1.2
1.3
1.4
1.5
1.6
1.7
2
3
PAGE
Background: k-Out *Graphs* . . . . . .
Background… …Background: k-Out *Graphs*
In the study of random *graphs*, two (closely related) models… …x28;n, M ) is chosen uniformly
at random from the set of all *graphs* with vertex set… …15] that initiated the study of random
*graphs*. The model G(n, p), often…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Peterson, N. R. (2013). On Random k-Out Graphs with Preferential Attachment. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839

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

Peterson, Nicholas Richard. “On Random k-Out Graphs with Preferential Attachment.” 2013. Doctoral Dissertation, The Ohio State University. Accessed January 18, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839.

MLA Handbook (7^{th} Edition):

Peterson, Nicholas Richard. “On Random k-Out Graphs with Preferential Attachment.” 2013. Web. 18 Jan 2020.

Vancouver:

Peterson NR. On Random k-Out Graphs with Preferential Attachment. [Internet] [Doctoral dissertation]. The Ohio State University; 2013. [cited 2020 Jan 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839.

Council of Science Editors:

Peterson NR. On Random k-Out Graphs with Preferential Attachment. [Doctoral Dissertation]. The Ohio State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839