edge independence number

edge independence number

[¦ej ‚in·də′pen·dəns ‚nəm·bər]
(mathematics)
For a graph, the largest possible number of edges in a matching.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
Let G be a connected graph of order n and [alpha]'(G) edge independence number of G.
Edge-neighbor-rupture degree of graphs
The independence number and edge independence number of G are respectively denoted by [[beta].sub.0] and [[beta].sub.1].
Some bounds on domination related parameters
Encyclopedia browser ?
Full browser ?