197 results on '"Klavžar, Sandi"'
Search Results
2. Packings in bipartite prisms and hypercubes
3. The general position avoidance game and hardness of general position games
4. Partial domination in supercubic graphs
5. New transmission irregular chemical graphs
6. A characterization of 4-[formula omitted]-vertex-critical graphs for packing sequences with [formula omitted] and [formula omitted]
7. Computational complexity aspects of super domination
8. Variety of mutual-visibility problems in graphs
9. Orientable domination in product-like graphs
10. Relativistic topological and spectral characteristics of zeolite SAS structures
11. Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
12. The general position achievement game played on graphs
13. Relativistic distance based and bond additive topological descriptors of zeolite RHO materials
14. On the average Steiner 3-eccentricity of trees
15. Comparing Wiener complexity with eccentric complexity
16. Constructing new families of transmission irregular graphs
17. [formula omitted]-packing chromatic vertex-critical graphs
18. Maker–Breaker total domination game
19. Metric properties of generalized Sierpiński graphs over stars
20. Game total domination critical graphs
21. On the difference between the (revised) Szeged index and the Wiener index of cacti
22. On the signed Roman [formula omitted]-domination: Complexity and thin torus graphs
23. Grundy dominating sequences and zero forcing sets
24. Graphs that are simultaneously efficient open domination and efficient closed domination graphs
25. A survey and classification of Sierpiński-type graphs
26. Weighted Harary indices of apex trees and [formula omitted]-apex trees
27. Domination game: Extremal families of graphs for [formula omitted]-conjectures
28. The index of a binary word
29. Generalized Fibonacci cubes
30. Two-ended regular median graphs
31. The degree sequence of Fibonacci and Lucas cubes
32. Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
33. The distinguishing chromatic number of Cartesian products of two complete graphs
34. Thresholds for the monochromatic clique transversal game.
35. Induced cycles in crossing graphs of median graphs
36. Vertex-, edge-, and total-colorings of Sierpiński-like graphs
37. On the geodetic number and related metric sets in Cartesian product graphs
38. Dominating direct products of graphs
39. Maximal proper subgraphs of median graphs
40. On cube-free median graphs
41. On induced and isometric embeddings of graphs into the strong product of paths
42. [formula omitted]-graceful labelings of partial cubes
43. On median nature and enumerative properties of Fibonacci-like cubes
44. Partial cubes as subdivision graphs and as generalized Petersen graphs
45. On the Frame–Stewart algorithm for the multi-peg Tower of Hanoi problem
46. Clar number of catacondensed benzenoid hydrocarbons
47. Resonance graphs of catacondensed even ring systems are median
48. On subgraphs of Cartesian product graphs
49. Cubes polynomial and its derivatives
50. On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract)
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.