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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 20 no. 2; číslo Graph Theory
Hlavní autori:	Dehghan, Ali, Sadeghi, Mohammad-Reza, Ahadi, Arash
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Discrete Mathematics & Theoretical Computer Science 17.12.2018
Predmet:	computer science - computational complexity mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!