From the 1 of 1.2k papers with an AI index.
2k citations
- S. Nishida3 profiles537 · h 54
- M. Nakao3 profiles506 · h 61
- S. Uno2 profiles504 · h 74
- G. Varner2 profiles502 · h 84
- S. Korpar2 profiles481 · h 71
- T. Sumiyoshi2 profiles481 · h 76
- M. Starič2 profiles480 · h 66
- V. Zhilich2 profiles477 · h 68
- A. Ishikawa2 profiles468 · h 72
- K. Senyo2 profiles468 · h 72
- M. Bračko2 profiles459 · h 73
- H. Miyata2 profiles454 · h 75
- 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
85 papers · 1 filter
Revisiting -distance (independent) domination in trees and in bipartite graphs
Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1
The -distance -packing domination number of is the minimum size of a set of vertices of which is both a -distance dominating set and a -packing. In 1…
Injective (edge) colorings of generalized Sierpiński graphs
C. K. Bhanupriya, Boštjan Brešar
Generalized Sierpiński graphs constitute a distinctive class of fractal-like networks with recursive definition: given a graph , while is obtained from $|V(G)|…
Bounds on the game isolation number and exact values for paths and cycles
Csilla Bujtás, Tanja Dravec, Michael A. Henning +1
The isolation game is played on a graph by two players who take turns playing a vertex such that if is the set of already played vertices, then a vertex can be selected onl…
Three algorithmic approaches to the general position problem
Zahra Hamed-Labbafian, Narjes Sabeghi, Mostafa Tavakoli +1
If is a graph, then is a general position set if for every two vertices and every shortest -path , it holds that no inner vertex of l…
Thresholds for the biased Maker-Breaker domination games
Boštjan Brešar, Csilla Bujtás, Pakanun Dokyeesun +1
In the -biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph such that Dominator selects and Staller selects vertice…
Enumerating the number of -matchings in successively amalgamated graphs
Simon Grad, Sandi Klavžar
In this paper, the transfer matrix technique using the -matching vector is developed to compute the number of -matchings in an arbitrary graph which can be constructed by suc…