#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2008

2016

- This year (0)
- Last five years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

A subset S of vertices in a graph G is a called a geodetic dominating set if S is both a geodetic set and a (standard) dominating set. In this paper, we study geodetic domination on graphs.

- Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee
- Discrete Mathematics
- 2012

Given a graph G, its triangular line graph is the graph T (G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G as well as being within a common triangle. Graphs with a representation as the triangular line graph of some graph G are triangular line graphs, which have been studied under many names including… (More)

- Henry Escuadro, Futaba Fujie-Okamoto, Chad E. Musick
- Discrete Mathematics
- 2013

- Pranav Anand, Henry Escuadro, Ralucca Gera, Craig H. Martell
- Discrete Applied Mathematics
- 2011

Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and only if the words they represent co-occur in a relevant pattern in the text. Ideally, the words with similar meanings give rise to the vertices of a component of the graph.… (More)

- Henry Escuadro, Ping Zhang
- Discrete Mathematics
- 2008

- DERRICK STOLEE, ASSISTANT PROFESSOR, +5 authors S. G. Hartke
- 2014

On extremal graphs with a given number of perfect matchings, Items below were completed before starting at Iowa State University.

- Henry Escuadro, Futaba Fujie-Okamoto, Chad E. Musick
- Discussiones Mathematicae Graph Theory
- 2015

Let G be a connected graph of size at least 2 and c : E(G) → {0, 1,. .. , k − 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-vector code(v) = (a 0 , a 1 ,. .. , a k−1), where a i is the number of edges incident with v that are… (More)

- Linda Eroh, Henry Escuadro, Ralucca Gera, Samuel Prahlow, Karl Schmitt
- EJGTA
- 2016

- ‹
- 1
- ›