Some news about the independence number of a graph | Zendy

Jochen Harant | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Some news about the independence number of a graph

Author(s) -

Jochen Harant

Publication year - 2000

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1107

Subject(s) - independence number , mathematics , combinatorics , independence (probability theory) , undirected graph , graph , cube (algebra) , discrete mathematics , statistics

For a finite undirected graph G on n vertices some continuous optimizationproblems taken over the n-dimensional cube are presented and it is provedthat their optimum values equal the independence number of G.Keywords: graph, independence.1991 Mathematical Subject Classification: 05C35.1 Introduction and ResultsLet G be a finite simple and undirected graph on V (G) = f1; 2; :::; ng with itsedge set E(G). A subset I of V (G), such that the subgraph of G induced by Iis edgeless, is...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research