- Home
- Best Scientists - Mathematics
- Dragan Marušič

Mathematics

Slovenia

2022

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
32
Citations
3,476
163
World Ranking
2453
National Ranking
6

Computer Science
D-index
33
Citations
4,419
162
World Ranking
8747
National Ranking
13

2022 - Research.com Mathematics in Slovenia Leader Award

- Combinatorics
- Discrete mathematics
- Algebra

His primary scientific interests are in Discrete mathematics, Combinatorics, Symmetric graph, 1-planar graph and Vertex-transitive graph. He interconnects Permutation group and Transitive relation in the investigation of issues within Discrete mathematics. His Combinatorics study frequently involves adjacent topics like Invariant.

The Symmetric graph study combines topics in areas such as Petersen graph, Cubic graph, Semi-symmetric graph and Regular graph. His studies in 1-planar graph integrate themes in fields like Indifference graph and Modular decomposition. Dragan Marušič works mostly in the field of Vertex-transitive graph, limiting it down to topics relating to Cayley graph and, in certain cases, Odd graph, Cayley's theorem and Cayley table.

- Prevalence of pathological internet use among adolescents in Europe: demographic and social factors (387 citations)
- Adolescent subthreshold‐depression and anxiety: psychopathology, functional impairment and increased suicide risk (253 citations)
- Saving and Empowering Young Lives in Europe (SEYLE): a randomized controlled trial (103 citations)

Dragan Marušič mainly focuses on Combinatorics, Discrete mathematics, Vertex-transitive graph, Symmetric graph and Transitive relation. His work is connected to Automorphism, Graph, Vertex, Cayley graph and Cubic graph, as a part of Combinatorics. His study in Chordal graph, Edge-transitive graph, Graph automorphism, 1-planar graph and Voltage graph falls under the purview of Discrete mathematics.

The concepts of his Vertex-transitive graph study are interwoven with issues in Strongly regular graph, Comparability graph, Circulant graph and Regular graph. His research investigates the connection between Symmetric graph and topics such as Petersen graph that intersect with issues in Coxeter graph. Dragan Marušič combines subjects such as Neighbourhood and Permutation group with his study of Transitive relation.

- Combinatorics (104.23%)
- Discrete mathematics (66.14%)
- Vertex-transitive graph (32.28%)

- Combinatorics (104.23%)
- Automorphism (21.16%)
- Transitive relation (20.63%)

His main research concerns Combinatorics, Automorphism, Transitive relation, Vertex and Automorphism group. His study in Graph, Cayley graph, Vertex-transitive graph, Strongly regular graph and Hamiltonian path is carried out as part of his Combinatorics studies. Discrete mathematics covers Dragan Marušič research in Graph.

His Automorphism research is multidisciplinary, incorporating elements of Cubic graph and Group. He has included themes like Petersen graph, Permutation group and Prime in his Transitive relation study. His work in Automorphism group covers topics such as Parity of a permutation which are related to areas like Bipartite graph, Complete information and Torus.

- On normality of n-Cayley graphs (7 citations)
- Odd extensions of transitive groups via symmetric graphs – The cubic case (3 citations)
- Symmetric cubic graphs via rigid cells (1 citations)

- Combinatorics
- Algebra
- Topology

Combinatorics, Automorphism, Graph, Automorphism group and Cayley graph are his primary areas of study. His Combinatorics research focuses on Pointwise and how it relates to Cubic graph. His Cayley graph study combines topics in areas such as Cartesian product of graphs, Cartesian product, Finite group, Digraph and Vertex-transitive graph.

His biological study spans a wide range of topics, including Solvable group, Coxeter graph, Complete information, Vertex and Parity of a permutation. He has researched Vertex in several fields, including Petersen graph and Abelian group. Pappus graph is the subject of his research, which falls under Discrete mathematics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Adolescent subthreshold-depression and anxiety: psychopathology, functional impairment and increased suicide risk

Judit Balázs;Mónika Miklósi;Ágnes Keresztény;Christina W. Hoven.

Journal of Child Psychology and Psychiatry **(2013)**

498 Citations

Prevalence of pathological internet use among adolescents in Europe: demographic and social factors

Tony Durkee;Michael Kaess;Vladimir Carli;Peter Parzer.

Addiction **(2012)**

458 Citations

Saving and Empowering Young Lives in Europe (SEYLE): a randomized controlled trial

Danuta Wasserman;Vladimir Carli;Vladimir Carli;Camilla Wasserman;Alan Apter.

BMC Public Health **(2010)**

232 Citations

Elementary Abelian Covers of Graphs

Aleksander Malnič;Dragan Marušič;Primož Potočnik.

Journal of Algebraic Combinatorics **(2004)**

157 Citations

Maps and Half-transitive Graphs of Valency 4

D Marušič;R Nedela.

The Journal of Combinatorics **(1998)**

123 Citations

Constructing graphs which are ½-transitive

Brian Alspach;Dragan Marušič;Lewis Nowitz.

Journal of The Australian Mathematical Society **(1994)**

113 Citations

The role of impulsivity in self-mutilators, suicide ideators and suicide attempters - a study of 1265 male incarcerated individuals.

Vladimir Carli;Nikolina Jovanović;Anja Podlešek;Alec Roy.

Journal of Affective Disorders **(2010)**

110 Citations

A census of semisymmetric cubic graphs on up to 768 vertices

Marston Conder;Aleksander Malnič;Dragan Marušič;Primž Potočnik.

Journal of Algebraic Combinatorics **(2006)**

103 Citations

Half-Transitive Group Actions on Finite Graphs of Valency 4

Dragan Marušič.

Journal of Combinatorial Theory, Series B **(1998)**

92 Citations

Transitive Permutation Groups Without Semiregular Subgroups

Peter J. Cameron;Michael Giudici;Gareth A. Jones;William M. Kantor.

Journal of The London Mathematical Society-second Series **(2002)**

86 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Molise

Heidelberg University

University of Bern

Tel Aviv University

Columbia University

University College Cork

University of Oviedo

Heidelberg University

University of Milan

Martin Luther University Halle-Wittenberg

Iwate Prefectural University

University of Mons

University of Manitoba

University of Barcelona

University of Florence

University of Bristol

Universidade Federal de Viçosa

University of Gothenburg

University of Maine

University of Utah

Naval Postgraduate School

Mayo Clinic

University of Toronto

The Ohio State University

University of Amsterdam

Harvard University

Something went wrong. Please try again later.