Back to search

Clemson University

Vertex-Edge and Edge-Vertex Parameters in Graphs

Abstract

dc:description.abstract

The majority of graph theory research on parameters involved with domination, independence, and irredundance has focused on either sets of vertices or sets of edges; for example, sets of vertices that dominate all other vertices or sets of edges that dominate all other edges. There has been very little research on ``mixing'' vertices and edges. We investigate several new and several little-studied parameters, including vertex-edge domination, vertex-edge irredundance, vertex-edge independence, edge-vertex domination, edge-vertex irredundance, and edge-vertex independence.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lewis, Jason
Contributors dc:contributor
  • Hedetniemi, Stephen T
  • Dean , Brian C
  • Haynes , Teresa W
  • McRae , Alice A
  • Duchowski , Andrew T

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/103

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lewis, Jason. Vertex-Edge and Edge-Vertex Parameters in Graphs. Dissertation thesis, https://open.clemson.edu/all_dissertations/103