#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1994

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Elliptic curves also figured prominently in the recent proof of Fermat's Last Theorem by Andrew Wiles. Originally pursued for purely aesthetic reasons, elliptic curves have recently been utilized in devising algorithms for factoring integers, primality proving, and in public-key cryptography. In this article, we aim to give the reader an introduction to… (More)

- Aleksandar Jurisic, Jacobus H. Koolen
- Discrete Mathematics
- 2002

- Amira S. Egic, Donka V. Mojovic, +4 authors Natasa T. Karadzov-Orlic
- Obstetrics and gynecology international
- 2014

Objective. Our objective was to estimate degree and rate of discordant growth and its impact on perinatal outcome in dichorionic twin pregnancies conceived by in vitro fertilization (IVF) compared to those conceived spontaneously. Study Design. Growth discordance was defined as 90th percentiles for the study population. Adverse perinatal outcome was defined… (More)

- Aleksandar Jurisic, Jacobus H. Koolen
- Des. Codes Cryptography
- 2000

Let Γ be a distance-regular graph with diameter d. For vertices x and y of Γ at distance i, 1 ≤ i ≤ d, we define the sets Ci(x, y) = Γi−1(x) ∩ Γ(y), Ai(x, y) = Γi(x) ∩ Γ(y) and Bi(x, y) = Γi+1(x) ∩ Γ(y). Then we say Γ has the CABj property, if the partition CABi(x, y) = {Ci(x, y), Ai(x, y), Bi(x, y)} of the local graph of y is equitable for each pair of… (More)

- Aleksandar Jurisic, Jacobus H. Koolen
- Eur. J. Comb.
- 2000

- Aleksandar Jurisic
- Discrete Mathematics
- 1998

Antipodal covers of strongly regular graphs which are not necessarily distance-regular are studied. The structure of short cycles in an antipodal cover is considered. In most cases, this provides a tool to determine if a strongly regular graph has an antipodal cover. In these cases, covers cannot be distance-regular except when they cover a complete… (More)

- Aleksandar Jurisic, Jacobus H. Koolen, Stefko Miklavic
- J. Comb. Theory, Ser. B
- 2005

We classify triangleand pentagon-free distance-regular graphs with diameter d ≥ 2, valency k, and an eigenvalue multiplicity k. In particular, we prove that such a graph is isomorphic to a cycle, a k-cube, a complete bipartite graph minus a matching, a Hadamard graph, a distance-regular graph with intersection array {k, k − 1, k − c, c, 1; 1, c, k − c, k −… (More)

- Aleksandar Jurisic
- Discrete Mathematics
- 2003

- Kris Coolsaet, Aleksandar Jurisic
- J. Comb. Theory, Ser. A
- 2008

Let be a distance-regular graph of diameter d ≥ 2 and a1 = 0. Let θ be a real number. A pseudo cosine sequence for θ is a sequence of real numbers σ0, . . . , σd such that σ0 = 1 and ciσi−1 + aiσi + biσi+1 = θσi for all i ∈ {0, . . . , d−1}. Furthermore, a pseudo primitive idempotent for θ is Eθ = s ∑di=0 σiAi , where s is any nonzero scalar. Let v̂ be the… (More)