Iskanje po repozitoriju

A+ | A- | | SLO | ENG

Ključne besede: nursing home, obesity, older adult, sarcopenia, sarcopenic obesity
Objavljeno v DiRROS: 02.10.2025; Ogledov: 294; Prenosov: 144
Celotno besedilo (559,50 KB)
Gradivo ima več datotek! Več...

Ključne besede: zinc oxide, synthesis, photocatalysis, gas sensing, ethanol
Objavljeno v DiRROS: 02.10.2025; Ogledov: 203; Prenosov: 101
Celotno besedilo (2,51 MB)
Gradivo ima več datotek! Več...

Ključne besede: passivation film, hot-dip Al-Zn, carbon steel sheet, friction resistance
Objavljeno v DiRROS: 02.10.2025; Ogledov: 256; Prenosov: 124
Celotno besedilo (3,80 MB)
Gradivo ima več datotek! Več...

Povzetek: This article combines two contrasted graph theory topics. In one hand, the notion of coloring the vertices of a graph satisfying certain properties, which is a classical area in graph theory. In the second one, the notion of mutual-visibility between pairs of vertices, which is yet a fresh topic, but already an established and hot one due to several connections with other classical combinatorial topics. Given a graph $G$, a mutual-visibility coloring of $G$ is introduced as follows. We color two vertices $x,y\in V(G)$ with the same color, if there is a shortest $x,y$-path whose internal vertices have different colors than $x,y$. The smallest number of colors needed in a mutual-visibility coloring of $G$ is the mutual-visibility chromatic number of $G$, which is denoted $\chi_{\mu}(G)$. Relationships between $\chi_{\mu}(G)$ and its two parent ones, the chromatic number and the mutual-visibility number, are presented. Graphs of diameter two are considered, and in particular the asymptotic growth of the mutual-visibility number of the Cartesian product of complete graphs is determined. A greedy algorithm that finds a mutual-visibility coloring is designed and several possible scenarios on its efficiency are discussed. Several bounds are given in terms of other graph parameters such as the diameter, the order, the maximum degree, the degree of regularity of regular graphs, and/or the mutual-visibility number. For the corona products it is proved that the value of its mutual-visibility chromatic number depends on that of the first factor of the product. Graphs $G$ for which $\chi_{\mu}(G)=2$ are also considered.
Ključne besede: graph coloring, mutual-visibility set, mutual-visibility number, mutual-visibility chromatic number, graph product, diameter two graph
Objavljeno v DiRROS: 01.10.2025; Ogledov: 238; Prenosov: 112
Celotno besedilo (3,37 MB)
Gradivo ima več datotek! Več...

Ključne besede: varstvo gozdov, morfološke analize
Objavljeno v DiRROS: 01.10.2025; Ogledov: 212; Prenosov: 0
Gradivo ima več datotek! Več...