Temat: lexicographic product graphs - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Autorzy:: Kuziak, Dorota
Yero, Ismael G.
Rodríguez-Velázquez, Juan A.
Powiązania:: https://bibliotekanauki.pl/articles/31340465.pdf
Data publikacji:: 2016-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: strong metric dimension
strong metric basis
strong metric generator
lexicographic product graphs
Opis:: Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its factor graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 4; 1051-1064
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: A Note on the Thue Chromatic Number of Lexicographic Products of Graphs
Autorzy:: Peterin, Iztok
Schreyer, Jens
Škrabul’áková, Erika Fecková
Taranenko, Andrej
Powiązania:: https://bibliotekanauki.pl/articles/31342285.pdf
Data publikacji:: 2018-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: non-repetitive colouring
Thue chromatic number
lexicographic product of graphs
Opis:: A sequence is called non-repetitive if none of its subsequences forms a repetition (a sequence r₁r₂⋯r_2n such that r_i = r_n+i for all 1 ≤ i ≤ n). Let G be a graph whose vertices are coloured. A colouring ϕ of the graph G is non-repetitive if the sequence of colours on every path in G is non-repetitive. The Thue chromatic number, denoted by π(G), is the minimum number of colours of a non-repetitive colouring of G. In this short note we present two general upper bounds for the Thue chromatic number for the lexicographic product G ◦ H of graphs G and H with respect to some properties of the factors. One upper bound is then used to derive the exact values for π(G ◦ H) when G is a complete multipartite graph and H an arbitrary graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2018, 38, 3; 635-643
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Edge-Transitive Lexicographic and Cartesian Products
Autorzy:: Imrich, Wilfried
Iranmanesh, Ali
Klavžar, Sandi
Soltani, Abolghasem
Powiązania:: https://bibliotekanauki.pl/articles/31340755.pdf
Data publikacji:: 2016-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: edge-transitive graph
vertex-transitive graph
lexicographic product of graphs
Cartesian product of graphs
Opis:: In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge-transitive and H is edgeless. If the first factor of G ∘ H is non-trivial and complete, then G ∘ H is edge-transitive if and only if H is the lexicographic product of a complete graph by an edgeless graph. This fixes an error of Li, Wang, Xu, and Zhao [11]. For the Cartesian product it is shown that every connected Cartesian product of at least two non-trivial factors is edge-transitive if and only if it is the Cartesian power of a connected, edge- and vertex-transitive graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 4; 857-865
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Union of Distance Magic Graphs
Autorzy:: Cichacz, Sylwia
Nikodem, Mateusz
Powiązania:: https://bibliotekanauki.pl/articles/31342130.pdf
Data publikacji:: 2017-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: distance magic labeling
magic constant
sigma labeling
graph labeling
union of graphs
lexicographic product
direct product
Kronecker product
Kotzig array
Opis:: A distance magic labeling of a graph $G = (V,E)$ with $|V | = n$ is a bijection $ \mathcal{l} $ from $V$ to the set ${1, . . ., n}$ such that the weight $ w(x) = \Sigma_{ y \in N_G } (x) \mathcal{l}(y) $ of every vertex $ x \in V $ is equal to the same element $ \mu $, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 1; 239-249
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja