212 citations
- Center for Astrophysics Harvard & SmithsonianUS3 papers
- DePaul UniversityUS2 papers
- San Jose State UniversityUS2 papers
- Smithsonian Astrophysical ObservatoryUS2 papers
- University of Houston - DowntownUS2 papers
- University of JohannesburgZA2 papers
- Advacam (Czechia)CZ1 paper
- AGH University of KrakowPL1 paper
- Aryabhatta Research Institute of Observational SciencesIN1 paper
- Auburn UniversityUS1 paper
- Brera Astronomical ObservatoryIT1 paper
- China Jiliang UniversityCN1 paper
20 papers
The Transformation Risk-Benefit Model of Artificial Intelligence: Balancing Risks and Benefits Through Practical Solutions and Use Cases
Richard Fulton, Diane Fulton, Nate Hayes +1
This paper summarizes the most cogent advantages and risks associated with Artificial Intelligence from an in-depth review of the literature. Then the authors synthesize the salien…
Grundy domination of forests and the strong product conjecture
Kayla Bell, Keith Driscoll, Elliot Krop +1
A maximum sequence of vertices in a graph , so that every vertex in has a neighbor which is independent, or is itself independent, from all previous vertices in , is…
Cosmic Ray Extremely Distributed Observatory
Piotr Homola, Dmitriy Beznosko, Gopal Bhatta +60
The Cosmic Ray Extremely Distributed Observatory (CREDO) is a newly formed, global collaboration dedicated to observing and studying cosmic rays (CR) and cosmic ray ensembles (CRE)…
Comparing X-ray color selection in separating X-ray binary classes using Color-Color-Intensity diagrams
Nazma Islam, S. D. Vrtilek, Bram Boroson +13
X-ray binaries exhibit a wide range of properties but there are few accepted methods to determine the nature of the compact object. Color-Color-Intensity diagrams have been suggest…
Upper bounds for inverse domination in graphs
Elliot Krop, Jessica McDonald, Gregory J. Puleo
In any graph , the domination number is at most the independence number . The Inverse Domination Conjecture says that, in any isolate-free , there exists pair of…
Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
Zhao Wang, Yaping Mao, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…