Forbidding and enforcing on graphs

Authors:
Daniela Genova;Nataa Jonoska
Affiliations:
Department of Mathematics and Statistics, University of North Florida, Jacksonville, FL 32224, USA;Department of Mathematics and Statistics, University of South Florida, Tampa, FL 33620, USA
Venue:
Theoretical Computer Science
Year:
2012

Citing 5
Cited 1

Graph theory and its applications

Graph theory and its applications
Forbidding-enforcing systems

Theoretical Computer Science - Algorithms,automata, complexity and games
Forbidding and enforcing in membrane computing

Natural Computing: an international journal
Topological properties of forbidding-enforcing systems

Journal of Automata, Languages and Combinatorics
Defining languages by forbidding-enforcing systems

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe

Generating DNA code words using forbidding and enforcing systems

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We define classes of graphs based on forbidding and enforcing boundary conditions. Forbidding conditions prevent a graph to have certain combinations of subgraphs and enforcing conditions impose certain subgraph structures. We say that a class of graphs is an fe-class if the class can be defined through forbidding and enforcing conditions (fe-system). We investigate properties of fe-systems and characterize familiar classes of graphs such as paths and cycles, trees, bi-partite, complete, Eulerian, and k-regular graphs as fe-classes.