default search action
Stefko Miklavic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j69]Blas Fernández, Roghayeh Maleki
, Stefko Miklavic, Giusy Monzillo:
Distance-regular graphs with classical parameters that support a uniform structure: Case q ≥ 2. Discret. Math. 348(2): 114263 (2025) - 2024
- [j68]Blas Fernández, Roghayeh Maleki, Stefko Miklavic, Giusy Monzillo:
On the $Q$-Polynomial Property of the Full Bipartite Graph of a Hamming Graph. Electron. J. Comb. 31(4) (2024) - [j67]Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Bounding the Mostar index. Discret. Math. 347(1): 113704 (2024) - [j66]Stefko Miklavic, Primoz Sparl:
On distance magic labelings of Hamming graphs and folded hypercubes. Discuss. Math. Graph Theory 44(1): 17 (2024) - [j65]Klavdija Kutnar
On the structure of consistent cycles in cubic symmetric graphs. J. Graph Theory 105(3): 337-356 (2024) - 2023
- [j64]György Kiss, Stefko Miklavic, Tamás Szonyi:
On girth-biregular graphs. Ars Math. Contemp. 23(4) (2023) - [j63]Stefko Miklavic, Primoz Sparl
On distance magic circulants of valency 6. Discret. Appl. Math. 329: 35-48 (2023) - [j62]Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Maximizing the Mostar index for bipartite graphs and split graphs. Discret. Optim. 48(Part 1): 100768 (2023) - [j61]Blas Fernández, Roghayeh Maleki
On closed distance magic circulants of valency up to 5. Discret. Math. 346(12): 113581 (2023) - 2022
- [j60]Blas Fernández, Stefko Miklavic:
On the Trivial T-Module of a Graph. Electron. J. Comb. 29(2) (2022) - [j59]Cafer Çaliskan, Stefko Miklavic, Sibel Özkan
Efficient domination in Cayley graphs of generalized dihedral groups. Discuss. Math. Graph Theory 42(3): 823-841 (2022) - [j58]Ademir Hujdurovic
On maximum intersecting sets in direct and wreath product of groups. Eur. J. Comb. 103: 103523 (2022) - [j57]Ademir Hujdurovic
On intersection density of transitive groups of degree a product of two odd primes. Finite Fields Their Appl. 78: 101975 (2022) - [j56]György Kiss, Stefko Miklavic
A stability result for girth-regular graphs with even girth. J. Graph Theory 100(1): 163-181 (2022) - 2021
- [j55]Stefko Miklavic, Primoz Sparl:
Distance-unbalancedness of graphs. Appl. Math. Comput. 405: 126233 (2021) - [j54]Klavdija Kutnar
On extendability of co-edge-regular graphs. Discret. Appl. Math. 298: 34-49 (2021) - [j53]Stefko Miklavic, Primoz Sparl
Generalized Gardiner-Praeger graphs and their symmetries. Discret. Math. 344(3): 112263 (2021) - [j52]Zoltán L. Blázsik
On the balanced upper chromatic number of finite projective planes. Discret. Math. 344(3): 112266 (2021) - [j51]Stefko Miklavic, Primoz Sparl
Classification of tetravalent distance magic circulant graphs. Discret. Math. 344(11): 112557 (2021) - [j50]Blas Fernández, Stefko Miklavic:
On bipartite graphs with exactly one irreducible T-module with endpoint 1, which is thin. Eur. J. Comb. 97: 103387 (2021) - 2020
- [j49]Stefko Miklavic, Safet Penjic
On the Terwilliger algebra of certain family of bipartite distance-regular graphs with Δ_2 = 0. Art Discret. Appl. Math. 3(2) (2020) - [j48]Mark S. MacLean, Stefko Miklavic:
On a certain class of 1-thin distance-regular graphs. Ars Math. Contemp. 18(2): 187-210 (2020) - [j47]Stefko Miklavic, Primoz Sparl:
On Minimal Distance-Regular Cayley Graphs of Generalized Dihedral Groups. Electron. J. Comb. 27(4): 4 (2020)
2010 – 2019
- 2019
- [j46]Klavdija Kutnar
The Classification of 2-Extendable Edge-Regular Graphs with Diameter 2. Electron. J. Comb. 26(1): 1 (2019) - [j45]Robert Jajcay, Stefko Miklavic, Primoz Sparl, Gorazd Vasiljevic:
On Certain Edge-Transitive Bicirculants. Electron. J. Comb. 26(2): 2 (2019) - [j44]Cafer Çaliskan, Stefko Miklavic, Sibel Özkan
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups. Discret. Appl. Math. 271: 15-24 (2019) - 2018
- [j43]Bostjan Frelih, Stefko Miklavic:
On 2-distance-balanced graphs. Ars Math. Contemp. 15(1): 81-95 (2018) - [j42]Stefko Miklavic:
On Bipartite Q-Polynomial Distance-Regular Graphs with Diameter 9, 10, or 11. Electron. J. Comb. 25(1): 1 (2018) - [j41]Stefko Miklavic, Primoz Sparl:
ℓ-distance-balanced graphs. Discret. Appl. Math. 244: 143-154 (2018) - [j40]Robert Jajcay, György Kiss, Stefko Miklavic:
Edge-girth-regular graphs. Eur. J. Comb. 72: 70-82 (2018) - [j39]Hermina Alajbegovic
On the Extendability of Quasi-Strongly Regular Graphs with Diameter 2. Graphs Comb. 34(4): 711-726 (2018) - 2017
- [j38]Mark S. MacLean, Stefko Miklavic:
On bipartite distance-regular graphs with exactly one non-thin T-module with endpoint two. Eur. J. Comb. 64: 125-137 (2017) - [j37]Nina Chiarelli, Cemil Dibek
On matching extendability of lexicographic products. RAIRO Oper. Res. 51(3): 857-873 (2017) - 2015
- [j36]Klavdija Kutnar, Stefko Miklavic, Tomaz Pisanski, Primoz Sparl:
Editorial. Ars Math. Contemp. 8(1) (2015) - [j35]Ted Dobson, István Kovács, Stefko Miklavic:
The automorphism groups of non-edge-transitive rose window graphs. Ars Math. Contemp. 9(1): 63-75 (2015) - [j34]Stefko Miklavic, Primoz Sparl:
On extendability of Deza graphs with diameter 2. Discret. Math. 338(8): 1416-1423 (2015) - 2014
- [j33]Stefko Miklavic, Safet Penjic:
On Bipartite Q-Polynomial Distance-Regular Graphs with c2 ≤ 2. Electron. J. Comb. 21(4): 4 (2014) - [j32]Edward Dobson, István Kovács, Stefko Miklavic:
The isomorphism problem for rose window graphs. Discret. Math. 323: 7-13 (2014) - [j31]Klavdija Kutnar
Nicely distance-balanced graphs. Eur. J. Comb. 39: 57-67 (2014) - [j30]Stefko Miklavic, Primoz Sparl:
On distance-regular Cayley graphs on abelian groups. J. Comb. Theory B 108: 102-122 (2014) - 2013
- [j29]Stefko Miklavic:
A note on a conjecture on consistent cycles. Ars Math. Contemp. 6(2): 389-392 (2013) - [j28]Bostjan Frelih, Stefko Miklavic:
Edge Regular Graph Products. Electron. J. Comb. 20(1): 62 (2013) - [j27]Stefko Miklavic:
On Bipartite Distance-Regular Graphs with Intersection Numbers c i = (q i - 1)/(q - 1). Graphs Comb. 29(1): 121-130 (2013) - 2012
- [j26]Stefko Miklavic, Primoz Sparl:
On the connectivity of bipartite distance-balanced graphs. Eur. J. Comb. 33(2): 237-247 (2012) - [j25]Stefko Miklavic, Primoz Sparl:
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups. J. Graph Theory 70(4): 384-403 (2012) - 2011
- [j24]Marko Boben, Stefko Miklavic, Primoz Potocnik:
Rotary Polygons in Configurations. Electron. J. Comb. 18(1) (2011) - [j23]Stefko Miklavic, Martin Milanic
Equistable graphs, general partition graphs, triangle graphs, and graph products. Discret. Appl. Math. 159(11): 1148-1159 (2011) - 2010
- [j22]Stefko Miklavic:
On vertex-stabilizers of bipartite dual polar graphs. Ars Math. Contemp. 3(1): 49-58 (2010)
2000 – 2009
- 2009
- [j21]Klavdija Kutnar, Aleksander Malnic, Dragan Marusic
The strongly distance-balanced property of the generalized Petersen graphs. Ars Math. Contemp. 2(1): 41-47 (2009) - [j20]Marko Boben, Stefko Miklavic, Primoz Potocnik:
Consistent Cycles in 1/2-Arc-Transitive Graphs. Electron. J. Comb. 16(1) (2009) - [j19]Yong Qin, Wenjun Xiao, Stefko Miklavic:
Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity. Discret. Math. 309(17): 5426-5431 (2009) - [j18]Stefko Miklavic, Primoz Sparl:
On Hamiltonicity of circulant digraphs of outdegree three. Discret. Math. 309(17): 5437-5443 (2009) - [j17]Stefko Miklavic:
Q-polynomial distance-regular graphs with a1=0 and a2!=0. Eur. J. Comb. 30(1): 192-207 (2009) - [j16]István Kovács, Aleksander Malnic
One-matching bi-Cayley graphs over abelian groups. Eur. J. Comb. 30(2): 602-616 (2009) - [j15]Klavdija Kutnar
Strongly regular tri-Cayley graphs. Eur. J. Comb. 30(4): 822-832 (2009) - 2008
- [j14]Stefko Miklavic, Primoz Potocnik, Steve Wilson:
Arc-transitive cycle decompositions of tetravalent graphs. J. Comb. Theory B 98(6): 1181-1192 (2008) - 2007
- [j13]Stefko Miklavic:
On bipartite Q-polynomial distance-regular graphs with c2=1. Discret. Math. 307(3-5): 544-553 (2007) - [j12]Aleksander Malnic
Semisymmetric elementary abelian covers of the Möbius-Kantor graph. Discret. Math. 307(17-18): 2156-2175 (2007) - [j11]Stefko Miklavic:
On bipartite Q-polynomial distance-regular graphs. Eur. J. Comb. 28(1): 94-110 (2007) - [j10]Stefko Miklavic, Primoz Potocnik, Steve Wilson:
Consistent Cycles in Graphs and Digraphs. Graphs Comb. 23(2): 205-216 (2007) - [j9]Stefko Miklavic, Primoz Potocnik:
Distance-regular Cayley graphs on dihedral groups. J. Comb. Theory B 97(1): 14-33 (2007) - [j8]Stefko Miklavic, Primoz Potocnik, Steve Wilson:
Overlap in consistent cycles. J. Graph Theory 55(1): 55-71 (2007) - 2006
- [j7]Stefko Miklavic, Primoz Potocnik:
Distance-transitive dihedrants. Des. Codes Cryptogr. 41(2): 185-193 (2006) - [j6]Klavdija Kutnar
Distance-balanced graphs: Symmetry conditions. Discret. Math. 306(16): 1881-1894 (2006) - 2005
- [j5]Aleksandar Jurisic, Jack H. Koolen
Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency. J. Comb. Theory B 94(2): 245-258 (2005) - [j4]Stefko Miklavic:
An equitable partition for a distance-regular graph of negative type. J. Comb. Theory B 95(2): 175-188 (2005) - 2004
- [j3]Stefko Miklavic:
Q-polynomial distance-regular graphs with a1=0. Eur. J. Comb. 25(7): 911-920 (2004) - 2003
- [j2]Stefko Miklavic, Primoz Potocnik:
Distance-regular circulants. Eur. J. Comb. 24(7): 777-784 (2003) - 2002
- [j1]Stefko Miklavic:
Valency of Distance-regular Antipodal Graphs with Diameter 4. Eur. J. Comb. 23(7): 845-849 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: