Results 21 to 30 of about 1,343 (197)

Geodetic numbers of tensor product and lexicographic product of graphs [PDF]

open access: yesAKCE International Journal of Graphs and Combinatorics
A shortest [Formula: see text]-[Formula: see text] path between two vertices u and v of a graph G is a [Formula: see text]-[Formula: see text] geodesic of G.
K. Raja Chandrasekar
doaj   +2 more sources

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs.
Didem Gözüpek   +2 more
doaj   +3 more sources

Choosability and paintability of the lexicographic product of graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2017
This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if $G$ has maximum degree $Δ$, then for any graph $H$ on $n$ vertices $ch(G[H]) \le (4Δ+2)(ch(H) +\log_2 n)$ and $χ_P(G[H]) \le (4Δ+2) (χ_P(H)+ \log_2 n)$.
Balázs Keszegh, Xuding Zhu
openaire   +5 more sources

The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs [PDF]

open access: yesDiscussiones Mathematicae Graph Theory, 2018
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj   +2 more sources

Infinite Lexicographic Products of Triangular Algebras [PDF]

open access: yesBulletin of the London Mathematical Society, 1995
Some new connections are given between linear orderings and triangular operator algebras. A lexicograhic product is defined for triangular operator algebras and the Jacobson radical of an infinite lexicographic product of upper triangular matrix algebras is determined.
Power, S. C.
openaire   +5 more sources

Computing Correlation among the Graphs under Lexicographic Product via Zagreb Indices [PDF]

open access: yesJournal of Chemistry, 2021
A topological index (TI) is a numerical descriptor of a molecule structure or graph that predicts its different physical, biological, and chemical properties in a theoretical way avoiding the difficult and costly procedures of chemical labs.
Muhammad Javaid   +3 more
doaj   +2 more sources

Utilizing lexicographic max product of picture fuzzy graph in human trafficking [PDF]

open access: yesAin Shams Engineering Journal
Graph structures are an essential tool for solving combinatorial problems in computer science and computational intelligence. With an emphasis on signed graphs, picture-fuzzy graphs, and graphs with colored or labeled edges, this study explores the ...
Peide Liu   +4 more
doaj   +2 more sources

Lexicographic palindromic products

open access: yesThe Art of Discrete and Applied Mathematics, 2022
Summary: A graph \(G\) on \(n\) vertices is \textit{palindromic} if there is a vertex-labeling bijection \(f : V(G) \rightarrow \{1, 2, \dots, n\}\) with the property that for any edge \(vw \in E(G)\), there is an edge \(xy \in E(G)\) for which \(f(x) = n - f(v) + 1\) and \(f(y) = n - f(w) + 1\).
openaire   +2 more sources

Functorial equations for lexicographic products [PDF]

open access: yesProceedings of the American Mathematical Society, 2003
Summary: We generalize the main result of an earlier paper by the authors [Proc. Am. Math. Soc. 125, 3177-3183 (1997; Zbl 0888.12004)] concerning the convex embeddings of a chain \(\Gamma\) in a lexicographic power \(\Delta^{\Gamma}\). For a fixed non-empty chain \(\Delta\), we derive necessary and sufficient conditions for the existence of non-empty ...
Kuhlmann, Franz-Viktor   +2 more
openaire   +3 more sources

Graph Invariants of Deleted Lexicographic Product of Graphs [PDF]

open access: yesMathematics Interdisciplinary Research, 2019
‎The deleted lexicographic‎ ‎product G[H]-nG of graphs G and H is a graph with vertex set V(G)×V(H)‎ and u=(u1‎, ‎v1) is adjacent with v=(u2‎, ‎v2) whenever (u1=u2 and‎ v1 is adjacent with v2) or (v1 ≠ v2 and u1 is adjacent with u2)‎.
Bahare Akhavan Mahdavi   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy