Friendly-index set
id:
friendly-index-set-320-16999163
title:
Friendly-index set
text:
In graph theory, a friendly-index set is a finite set of integers associated with a given undirected graph and generated by a type of graph labeling called a friendly labeling. A friendly labeling of an n-vertex undirected graph G = (V,E) is defined to be an assignment of the values 0 and 1 to the vertices of G with the property that the number of vertices labeled 0 is as close as possible to the number of vertices labeled 1: they should either be equal or differ by one. Given a friendly labelin
brand slug:
wiki
category slug:
encyclopedia
description:
Set of integers in graph theory
original url:
https://en.wikipedia.org/wiki/Friendly-index_set
date created:
date modified:
2023-08-11T18:08:10Z
main entity:
{"identifier":"Q5504045","url":"https://www.wikidata.org/entity/Q5504045"}
image:
fields total:
13
integrity:
14