2k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of LjubljanaSI633 papers
- Jožef Stefan InstituteSI577 papers
- Korea UniversityKR549 papers
- Nagoya UniversityJP545 papers
- University of CincinnatiUS544 papers
- Virginia TechUS539 papers
- National Taiwan UniversityTW538 papers
- The University of TokyoJP537 papers
- Budker Institute of Nuclear PhysicsRU534 papers
- Yonsei UniversityKR534 papers
- The University of MelbourneAU533 papers
- High Energy Accelerator Research OrganizationJP531 papers
34 papers · 1 filter
Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
Csilla Bujtás, Sandi Klavžar, Jing Tian
Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the…
Extremal results on -stepwise irregular graphs
Yaser Alizadeh, Sandi Klavžar, Javaher Langari
For a positive integer , a graph is -stepwise irregular (-SI graph) if the degrees of every pair of adjacent vertices differ by exactly . Such graphs are neces…
Graphs with span 1 and shortest optimal walks
Tanja Dravec, Mirjana Mikalački, Andrej Taranenko
A span of a given graph is the maximum distance that two players can keep at all times while visiting all vertices (edges) of and moving according to certain rules, that pr…
Counting largest mutual-visibility and general position sets of glued -ary trees
Dhanya Roy, Sandi Klavžar, Aparna Lakshmanan S
All four invariants of the mutual-visibility problem and, all four invariants of the general position problem are determined for glued binary trees. The number of the corresponding…
Can metacognition predict your success in solving problems? An exploratory case study in programming
Bostjan Bubnic, Željko Kovačević, Tomaž Kosar
Metacognition has been recognized as an essential skill for academic success and for performance in solving problems. During learning or problem-solving, metacognitive skills facil…
Dual-Step Optimization for Binary Sequences with High Merit Factors
Blaž Pšeničnik, Rene Mlinarič, Janez Brest +1
The problem of finding aperiodic low auto-correlation binary sequences (LABS) presents a significant computational challenge, particularly as the sequence length increases. Such se…
Evolutionary mechanisms that promote cooperation may not promote social welfare
The Anh Han, Manh Hong Duong, Matjaz Perc
Understanding the emergence of prosocial behaviours among self-interested individuals is an important problem in many scientific disciplines. Various mechanisms have been proposed…
General position problems in strong and lexicographic products of graphs
Pakanun Dokyeesun, Sandi Klavžar, Dorota Kuziak +1
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general…
Cross-sectional personal network analysis of adult smoking in rural areas
Bianca-Elena Mihăilă, Marian-Gabriel Hâncean, Matjaž Perc +5
While research on adolescent smoking is extensive, little attention has been given to smoking behaviors among rural middle-aged and older adults. This study examines the role of pe…
Maker-Breaker domination game critical graphs
Athira Divakaran, Tanja Dravec, Tijo James +2
The Maker-Breaker domination game (MBD game) is a two-player game played on a graph by Dominator and Staller. They alternately select unplayed vertices of . The goal of Domi…
Multifractality and excited-state quantum phase transition in ferromagnetic spin- Bose-Einstein condensates
Zhen-Xia Niu, Qian Wang
Multifractality of quantum states plays an important role for understanding numerous complex phenomena observed in different branches of physics. The multifractal properties of the…
On -distance-balancedness of generalized Petersen graphs
Gang Ma, Jianfeng Wang, Sandi Klavžar
A connected graph of diameter is -distance-balanced if for every with , where is the…
Maker-Breaker resolving game played on corona products of graphs
Tijo James, Sandi Klavžar, Dorota Kuziak +2
The Maker-Breaker resolving game is a game played on a graph by Resolver and Spoiler. The players taking turns alternately in which each player selects a not yet played vertex…
Global synchronization in generalized multilayer higher-order networks
Palash Kumar Pal, Md Sayeed Anwar, Matjaz Perc +1
Networks incorporating higher-order interactions are increasingly recognized for their ability to introduce novel dynamics into various processes, including synchronization. Previo…
Information Dynamics in Evolving Networks Based on the Birth-Death Process: Random Drift and Natural Selection Perspective
Minyu Feng, Ziyan Zeng, Qin Li +2
Dynamic processes in complex networks are crucial for better understanding collective behavior in human societies, biological systems, and the internet. In this paper, we first foc…
HERMES: Gamma Ray Burst and Gravitational Wave counterpart hunter
G. Ghirlanda, L. Nava, O. Salafia +67
Gamma Ray Bursts (GRBs) bridge relativistic astrophysics and multi-messenger astronomy. Space-based gamma/X-ray wide field detectors have proven essential to detect and localize th…
The general position number under vertex and edge removal
Pakanun Dokyeesun, Sandi Klavžar, Jing Tian
Let be the general position number of a graph . It is proved that holds for any vertex of a connected graph and that if $x…
We need to aim at the top: Factors associated with cybersecurity awareness of cyber and information security decision-makers
Simon Vrhovec, Blaž Markelj
Cyberattacks pose a significant business risk to organizations. Although there is ample literature focusing on why people pose a major risk to organizational cybersecurity and how…
Further results on the power-law decay of the fraction of the mixed eigenstates in kicked-top model with mixed-type classical phase space
Hua Yan, Qian Wang, Marko Robnik
By using the Krylov subspace technique to generate the spin coherent states in kicked top model, a prototype model for studying quantum chaos, the accessible system size for studyi…
General position sets, colinear sets, and Sierpiński product graphs
Sandi Klavžar, Jing Tian
Let denote the Sierpiński product of graphs and with respect to the function . The Sierpiński general position number is intro…
Metric dimensions of generalized Sierpiński graphs over squares
Savari Prabhu, T. Jenifer Janany, Sandi Klavžar
Metric dimension is a valuable parameter that helps address problems related to network design, localization, and information retrieval by identifying the minimum number of landmar…
Best possible upper bounds on the restrained domination number of cubic graphs
Boštjan Brešar, Michael A. Henning
A dominating set in a graph is a set of vertices such that every vertex in is adjacent to a vertex in . A restrained dominating set of is a domina…
Characterizing unstructured data with the nearest neighbor permutation entropy
Leonardo G. J. M. Voltarelli, Arthur A. B. Pessa, Luciano Zunino +4
Permutation entropy and its associated frameworks are remarkable examples of physics-inspired techniques adept at processing complex and extensive datasets. Despite substantial pro…
Language-based game theory in the age of artificial intelligence
Valerio Capraro, Roberto Di Paolo, Matjaz Perc +1
Understanding human behaviour in decision problems and strategic interactions has wide-ranging applications in economics, psychology, and artificial intelligence. Game theory offer…