# Maref Y. Alzoubi

- Citations Per Year

- Citations Per Year

- Full text PDF available (2)

Learn More

- M. M. M. Jaradat, Maref Y. Alzoubi
- Australasian J. Combinatorics
- 2005

- Maref Y. Alzoubi, Mohammed M. M. Jaradat
- Int. J. Math. Mathematical Sciences
- 2005

The graphs considered in this paper are finite, undirected, simple, and connected. Most of the notations that follow can be found in [6] or [8]. Let G= (V ,E) be a graph, where V and E are the vertex and the edge sets of G, respectively. If e1,e2, . . . ,eq is an ordering of the edges in G, then any subset S of edges corresponds to a (0,1)-vector (a1,a2, .… (More)

- ‹
- 1
- ›