Computer Science – Data Structures and Algorithms
Scientific paper
2007-02-09
Computer Science
Data Structures and Algorithms
21 pages, no figures, minor corrections
Scientific paper
Let $v$ be a vertex of a graph $G$. By the local complementation of $G$ at $v$ we mean to complement the subgraph induced by the neighbors of $v$. This operator can be generalized as follows. Assume that, each edge of $G$ has a label in the finite field $\mathbf{F}_q$. Let $(g_{ij})$ be set of labels ($g_{ij}$ is the label of edge $ij$). We define two types of operators. For the first one, let $v$ be a vertex of $G$ and $a\in \mathbf{F}_q$, and obtain the graph with labels $g'_{ij}=g_{ij}+ag_{vi}g_{vj}$. For the second, if $0\neq b\in \mathbf{F}_q$ the resulted graph is a graph with labels $g''_{vi}=bg_{vi}$ and $g''_{ij}=g_{ij}$, for $i,j$ unequal to $v$. It is clear that if the field is binary, the operators are just local complementations that we described. The problem of whether two graphs are equivalent under local complementations has been studied, \cite{bouchalg}. Here we consider the general case and assuming that $q$ is odd, present the first known efficient algorithm to verify whether two graphs are locally equivalent or not.
Bahramgiri Mohsen
Beigi Salman
No associations
LandOfFree
An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8132