◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Ryan

10 papers hereh-index 181.5k citations102 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author6
  • last author4

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • math.CO6
  • cs.DM3
  • cs.DS1
same name
  • J. Ryan — 41 papers, h 38
  • J. Ryan — 35 papers, h 11
  • J. Ryan — 27 papers, h 20
  • J. Ryan — 22 papers, h 17
  • J. Ryan — 16 papers, h 9
  • J. Ryan — 12 papers, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152026
most citedMonitoring the edges of a graph using distances

42 citations · 54 across the 10 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

cs.DM2016★ 4 cited

On the power domination number of de Bruijn and Kautz digraphs

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1

Let G=(V,A) be a directed graph without parallel arcs, and let S⊆V be a set of vertices. Let the sequence S=S0​⊆S1​⊆S2​⊆⋯ be defined a…

math.CO2016★ 1 cited

An algebraic approach to lifts of digraphs

C. Dalfó, M. A. Fiol, M. Miller +2

We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift Γα of a base (voltage) digraph. These techniques contract or e…

math.CO2016★ 1 cited

From expanded digraphs to lifts of voltage digraphs and line digraphs

C. Dalfó, M. A. Fiol, M. Miller +1

In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship…

cs.DM2016★ 1 cited

H-supermagic labelings for firecrackers, banana trees and flowers

Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1

A simple graph G=(V,E) admits an H-covering if every edge in E is contained in a subgraph H′=(V′,E′) of G which is isomorphic to H. In this case we say that G is H-…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.