Sigma Partitioning: Complexity and Random Graphs

A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The $\textit{ sigma number}$ of a graph $G$, deno...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 20 no. 2; no. Graph Theory
Main Authors:	Dehghan, Ali, Sadeghi, Mohammad-Reza, Ahadi, Arash
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 17.12.2018
Subjects:	computer science - computational complexity mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!