We stand with Ukraine  

Ryan Pepper

Affiliations:
  • University of Houston-Downtown, Department of Mathematics and Staistics, TX, USA


According to our database1, Ryan Pepper authored at least 18 papers between 2001 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator.
[BibTeX]
[DOI]
Randy Davila
,
Boris Brimkov
,
Ryan Pepper
CoRR, July, 2025

Comparing the p-independence number of regular graphs to the q-independence number of their line graphs.
[BibTeX]
[DOI]
Yair Caro
,
Randy Davila
,
Ryan Pepper
Discret. Appl. Math., 2025

2023
Zero and total forcing dense graphs.
[BibTeX]
[DOI]
Randy Davila
,
Michael A. Henning
,
Ryan Pepper
Discuss. Math. Graph Theory, 2023

2022
New results relating inependence and matchings.
[BibTeX]
[DOI]
Yair Caro
,
Randy Davila
,
Ryan Pepper
Discuss. Math. Graph Theory, 2022

2019
Extremal k-forcing sets in oriented graphs.
[BibTeX]
[DOI]
Yair Caro
,
Randy Davila
,
Ryan Pepper
Discret. Appl. Math., 2019

2018
Bounds on the Connected Forcing Number of a Graph.
[BibTeX]
[DOI]
Randy Davila
,
Michael A. Henning
,
Colton Magnant
,
Ryan Pepper
Graphs Comb., 2018

2016
Regular independent sets.
[BibTeX]
[DOI]
Yair Caro
,
Adriana Hansberg
,
Ryan Pepper
Discret. Appl. Math., 2016

2015
Upper bounds on the k-forcing number of a graph.
[BibTeX]
[DOI]
David Amos
,
Yair Caro
,
Randy Davila
,
Ryan Pepper
Discret. Appl. Math., 2015

2014
On the k-residue of disjoint unions of graphs with applications to k-independence.
[BibTeX]
[DOI]
David Amos
,
Randy Davila
,
Ryan Pepper
Discret. Math., 2014

Degree sequence index strategy.
[BibTeX]
[DOI]
Yair Caro
,
Ryan Pepper
Australas. J Comb., 2014

2013
On <i>k</i>k-domination and <i>j</i>j-independence in graphs.
[BibTeX]
[DOI]
Adriana Hansberg
,
Ryan Pepper
Discret. Appl. Math., 2013

2012
A Characterization of Graphs Where the Independence Number Equals the Radius.
[BibTeX]
[DOI]
Ermelinda DeLaViña
,
Craig E. Larson
,
Ryan Pepper
,
Bill Waller
Graphs Comb., 2012

2011
Graphs with equal Independence and Annihilation Numbers.
[BibTeX]
[DOI]
Craig E. Larson
,
Ryan Pepper
Electron. J. Comb., 2011

Bounds on the k-domination number of a graph.
[BibTeX]
[DOI]
Ermelinda DeLaViña
,
Wayne Goddard
,
Michael A. Henning
,
Ryan Pepper
,
Emil R. Vaughan
Appl. Math. Lett., 2011

2010
Lower bounds for the domination number.
[BibTeX]
[DOI]
Ermelinda DeLaViña
,
Ryan Pepper
,
Bill Waller
Discuss. Math. Graph Theory, 2010

2009
A note on dominating sets and average distance.
[BibTeX]
[DOI]
Ermelinda DeLaViña
,
Ryan Pepper
,
Bill Waller
Discret. Math., 2009

2008
An upper bound on the independence number of benzenoid systems.
[BibTeX]
[DOI]
Ryan Pepper
Discret. Appl. Math., 2008

2001
On New Didactics of Mathematics: Learning Graph Theory via Graffiti.
[BibTeX]
[DOI]
Ryan D. Pepper
Proceedings of the Graphs and Discovery, 2001


  Loading...