classes among the edges of a graph For two edges e = (x, y) and e ' = (x', y') of a connected graph G = (V, E) let e Oe' iff d(x. x') + ;(y, y') # d(x, y') + d(x', y). Here d(x, y) denotes the length of a shortest path in G joining vertices x and y. An algorithm is presented that computes the equiva
โฆ LIBER โฆ
Matrix equivalence classes with applications
โ Scribed by D.R Jensen; S.S Srinivasan
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 237 KB
- Volume
- 388
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Computing equivalence classes among the
โ
Franz Aurenhammer; Johann Hagauer
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 896 KB
A matrix method for partitioning the ato
โ
Malcolm Bersohn
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 440 KB
On equivalence and explicit solutions of
โ
Bin Zhou; Guang-Ren Duan
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 657 KB
The contragredient equivalence: Applicat
โ
P. Rubiรณ; J. Gelonch
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 924 KB
In this paper we apply the contragredient equivalence to solve two matrix systems. Firstly, we characterize and build all possible solutions of the matrix system P = XY, Q = YX, giving a recursive formula for the number of contragrediently nonequivalent solutions. And, secondly, we find the solution
Reduced cycle indices and their applicat
โ
K. Balasubramanian
๐
Article
๐
1989
๐
Springer
๐
English
โ 342 KB
Maximal frequencies of equivalences with
โ
Jiลรญ Demel
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 495 KB