C. Larson

activity

20092022

most citedSelf-Similar Graphs

18 citations · 20 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2022

Egerváry graphs: Deming decompositions and independence structure

P. Mark Kayll, Craig E. Larson

We leverage an algorithm of Deming [R.W. Deming, Independence numbers of graphs -- an extension of the Koenig-Egervary theorem, Discrete Math., 27(1979), no. 1, 23--33; MR534950] t…

math.CO2020

A Graph Theoretic Formula for the Number of Primes $π (n)$

R. Jacobs, C. E. Larson

Let PR $[n]$ be the graph whose vertices are $2, 3, \dots, n$ with vertex $v$ adjacent to vertex $w$ if and only if $g cd (v, w) > 1$ . It is shown that $π (n)$ , the the number of primes no…

math.CO2013★ 18 cited

Self-Similar Graphs

Kiran B. Chilakamarri, M. F. Khan, C. E. Larson +1

For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n, n}$ , we construct an infinite sequence of graphs based on the pair $(G, J)$ . The First graph in t…

math.CO2011★ 2 cited

Domination in Functigraphs

Linda Eroh, Ralucca Gera, Cong X. Kang +2

Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$ , and let $f : V (G_{1}) \to V (G_{2})$ be a function. Then a \emph{functigraph} $C (G, f) = (V, E)$ has the vertex set $V=V(G_1)…

math.CO2009

The Critical Independence Number and an Independence Decomposition

Craig Eric Larson

An independent set $I_{c}$ is a \textit{critical independent set} if $∣ I_{c} ∣ - ∣ N (I_{c}) ∣ \geq ∣ J ∣ - ∣ N (J) ∣$ , for any independent set $J$ . The \textit{critical independence number} of a…

Egerváry graphs: Deming decompositions and independence structure

A Graph Theoretic Formula for the Number of Primes π(n)

Self-Similar Graphs

Domination in Functigraphs

The Critical Independence Number and an Independence Decomposition

A Graph Theoretic Formula for the Number of Primes $π (n)$