Search Results - "Klavžar, Sandi"

Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments by Gradišar, Helena, Božič, Sabina, Doles, Tibor, Vengust, Damjan, Hafner-Bratkovič, Iva, Mertelj, Alenka, Webb, Ben, Šali, Andrej, Klavžar, Sandi, Jerala, Roman

“…DNA origami has shown that principles of molecular recognition can be used to reshape biomolecules into nonphysiological forms. The design and synthesis of a…”
Get full text

Generalized Pell graphs by IRSİC, VESNA, KLAVZAR, SANDI, TAN, ELİF

Get full text

Distance-based topological indices of nanosheets, nanotubes and nanotori of $$\hbox {SiO}_2$$ SiO 2 by Arockiaraj, Micheal, Klavžar, Sandi, Mushtaq, Shagufa, Balasubramanian, Krishnan

Get full text

On Grundy Total Domination Number in Product Graphs by Brešar, Boštjan, Bujtás, Csilla, Gologranc, Tanja, Klavžar, Sandi, Košmrlj, Gašper, Marc, Tilen, Patkós, Balázs, Tuza, Zsolt, vizer, Máté

“…A longest sequence ( , . . ., ) of vertices of a graph is a Grundy total dominating sequence of if for all , . The length of the sequence is called the Grundy…”
Get full text

Connected domination game played on Cartesian products by Bujtás, Csilla, Dokyeesun, Pakanun, Iršič, Vesna, Klavžar, Sandi

“…The connected domination game on a graph is played by Dominator and Staller according to the rules of the standard domination game with the additional…”
Get full text

The general position number of integer lattices by Klavžar, Sandi, Rus, Gregor

“…•The general position number of all integer grids is determined.•Only very partial results were known earlier, each of them required quite some effort to…”
Get full text

Dominated and dominator colorings over (edge) corona and hierarchical products by Klavžar, Sandi, Tavakoli, Mostafa

“…•Dominated and dominator colorings are graph colorings which are difficult to compute and frequently arise in applications.•This paper dominated and dominator…”
Get full text

Local metric dimension of graphs: Generalized hierarchical products and some applications by Klavžar, Sandi, Tavakoli, Mostafa

“…Let G be a graph and S⊆V(G). If every two adjacent vertices of G have different metric S-representations, then S is a local metric generator for G. A local…”
Get full text

On the mutual visibility in Cartesian products and triangle-free graphs by Cicerone, Serafino, Di Stefano, Gabriele, Klavžar, Sandi

“…•We investigate about mutual-visibility sets and mutual-visibility number (cardinality of a maximum mutual-visibility set), graph-theoretic concepts recently…”
Get full text

On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs by Alizadeh, Yaser, Klavžar, Sandi

“…If u is a vertex of a graph G, then the transmission of u is the sum of distances from u to all the other vertices of G. The Wiener complexity CW(G) of G is…”
Get full text

Edge General Position Sets in Fibonacci and Lucas Cubes by Klavžar, Sandi, Tan, Elif

“…A set of edges X ⊆ E ( G ) of a graph G is an edge general position set if no three edges from X lie on a common shortest path in G . The cardinality of a…”
Get full text

Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension by Arulperumjothi, M., Klavžar, Sandi, Prabhu, S.

“…•A hypercube variant fractal cubic network is redefined over the errored definition from [Engineering Science and Technology, an International Journal 18…”
Get full text

Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products by Tian, Jing, Klavžar, Sandi

Get full text

Geodesic packing in graphs by Manuel, Paul, Brešar, Boštjan, Klavžar, Sandi

Get full text

On Distance-Balanced Generalized Petersen Graphs by Ma, Gang, Wang, Jianfeng, Klavžar, Sandi

“…A connected graph G of diameter diam ( G ) ≥ ℓ is ℓ -distance-balanced if | W xy | = | W yx | for every x , y ∈ V ( G ) with d G ( x , y ) = ℓ , where W xy is…”
Get full text

Constructing new families of transmission irregular graphs by Xu, Kexiang, Klavžar, Sandi

“…The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices in G. A graph is transmission irregular if all of its…”
Get full text

Edge metric dimensions via hierarchical product and integer linear programming by Klavžar, Sandi, Tavakoli, Mostafa

“…If S = { v 1 , … , v k } is an ordered subset of vertices of a connected graph G and e is an edge of G , then the vector r G ( e | S ) = ( d G ( v 1 , e ) , ……”
Get full text

Computational complexity aspects of super domination by Bujtás, Csilla, Ghanbari, Nima, Klavžar, Sandi

“…Let G be a graph. A dominating set D⊆V(G) is a super dominating set if for every vertex x∈V(G)∖D there exists y∈D such that NG(y)∩(V(G)∖D))={x}. The…”
Get full text

The geodesic-transversal problem by Manuel, Paul, Brešar, Boštjan, Klavžar, Sandi

“…•The geodesic-transversal problem and the geodesic-transversal number are introduced.•The concepts are motivated by (large-scale) networks and by other…”
Get full text

New transmission irregular chemical graphs by Xu, Kexiang, Tian, Jing, Klavžar, Sandi

“…The transmission of a vertex v of a (chemical) graph G is the sum of distances from v to other vertices in G. If any two vertices of G have different…”
Get full text