Induced Matching
In graph theory, an induced matching or strong matching is a subset of the edges of an undirected graph that do not share any vertices (it is a Matching (graph theory), matching) and these are the only edges connecting any two vertices which are endpoints of the matching edges (it is an induced subgraph). An induced matching can also be described as an Independent set (graph theory), independent set in the Graph power, square of the line graph of the given graph. Strong coloring and neighborhoods The minimum number of induced matchings into which the edges of a graph can be partitioned is called its ''strong chromatic index'', by analogy with the chromatic index of the graph, the minimum number of matchings into which its edges can be partitioned. It equals the chromatic number of the square of the line graph. Brooks' theorem, applied to the square of the line graph, shows that the strong chromatic index is at most quadratic in the maximum degree of the given graph, but better ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   [Amazon]

Induced Matching 2
Induce may refer to: * Induced consumption * Induced innovation * Induced character * Induced coma * Induced menopause * Induced metric * Induced path * Induced topology * Induce (musician), American musician * Labor induction, stimulation of childbirth See also

* Inducement (other) * Induction (other) * * {{disambiguation ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   [Amazon]