What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (104.23%)
- Discrete mathematics (66.14%)
- Vertex-transitive graph (32.28%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (104.23%)
- Automorphism (21.16%)
- Transitive relation (20.63%)
In recent papers he was focusing on the following fields of study:
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.
Between 2017 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
