EUVIMEDEUVIMED entdecken
Crossref

On Locally-Balanced 2-Partitions of Complete Multipartite Graphs

Aram Gharibyan, Petros Petrosyan

Mathematical Problems of Computer Science · 2018

DOI: 10.51408/1963-0001 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Problems of Computer Science, 2018. Verfasst von Aram Gharibyan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 15 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A 2-partition of a graph G is a function f : V (G) →{White; Black}. A 2-partition f of a graph G is locally-balanced with an open neighborhood if for every ϑ ϵ V (G), ||{u ϵ NG(v): f (u) = White} |-| {u ϵ NG(v): f(u) = Black} ≤1; where NG(v) ={u ϵ V (G): uv ϵ E(G) }. A 2-partition f՛ 0 of a graph G is locallybalanced with a closed neighborhood if for every v ϵ V(G), ||{u ϵ NG(v): f՛ (u) = White} |-| {u ϵ NG[v]:; where NG[v] = NG(v)∪{v.} In this paper we give necessary and su±cient conditions for the existence of locally-balanced 2-partitions of complete multipartite graphs.

Zitieren

APA

Gharibyan, A., & Petrosyan, P. (2018). On Locally-Balanced 2-Partitions of Complete Multipartite Graphs. Mathematical Problems of Computer Science. https://doi.org/10.51408/1963-0001

Vancouver

Gharibyan A, Petrosyan P. On Locally-Balanced 2-Partitions of Complete Multipartite Graphs. Mathematical Problems of Computer Science. 2018. doi:10.51408/1963-0001

BibTeX
@article{Gharibyan2018,
  author = {Gharibyan, Aram and Petrosyan, Petros},
  title = {On Locally-Balanced 2-Partitions of Complete Multipartite Graphs},
  journal = {Mathematical Problems of Computer Science},
  year = {2018},
  doi = {10.51408/1963-0001}
}
Kostenlos starten →