Signed edge domination numbers of complete tripartite graphs: Part 2
The closed neighborhood $N_G[e]$ of an edge $e$ in a graph $G$ is the set consisting of $e$ and of all edges having an end-vertex in common with $e$. Let $f$ be a function on $E(G)$, the edge set of $G$, into the set $\{-1,1\}$. If $\sum_{x\in{N[e]}}f(x)\geq 1$ for each edge $e \in E(G)$, then $f$ i...
Saved in:
Main Author: | |
---|---|
Format: | Journal Article |
Language: | English |
Published: |
16-01-2017
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The closed neighborhood $N_G[e]$ of an edge $e$ in a graph $G$ is the set
consisting of $e$ and of all edges having an end-vertex in common with $e$. Let
$f$ be a function on $E(G)$, the edge set of $G$, into the set $\{-1,1\}$. If
$\sum_{x\in{N[e]}}f(x)\geq 1$ for each edge $e \in E(G)$, then $f$ is called a
signed edge dominating function of $G$. The signed edge domination number of
$G$ is the minimum weight of a signed edge dominating function of $G$. In this
paper, we find the signed edge domination number of the complete tripartite
graph $K_{m,n,p}$, where $1\leq m\leq n$ and $p\geq m+n$. This completes the
search for the signed edge domination numbers of the complete tripartite
graphs. |
---|---|
DOI: | 10.48550/arxiv.1701.04471 |