Results 41 to 50 of about 1,343 (197)
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs [PDF]
, 2023 summary:For a connected graph $G=(V,E)$ and a set $S \subseteq V(G)$ with at least two vertices, an $S$-Steiner tree is a subgraph $T = (V',E')$ of $G$ that is a tree with $S \subseteq V'$.
Mao, Yaping +2 more
core +1 more source
The Clustering Coefficient for Graph Products
Axioms, 2023 The clustering coefficient of a vertex v, of degree at least 2, in a graph Γ is obtained using the formula C(v)=2t(v)deg(v)(deg(v)−1), where t(v) denotes the number of triangles of the graph containing v as a vertex, and the clustering coefficient of Γ ...
Jhon J. Aguilar-Alarcón +2 more
doaj +1 more source
Characterization of the hyperbolicity in the lexicographic product
Electronic Notes in Discrete Mathematics, 2014 Abstract If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = { x 1 , x 2 , x 3 } is the union of the three geodesics [ x 1 x 2 ] , [ x 2 x 3 ] and [ x 3 x 1 ] in X.
Walter Carballosa +2 more
openaire +1 more source
On subgraph relationships between graph products
Journal of Nigerian Society of Physical SciencesGraph products play an important role in graph theory by providing systematic methods for constructing complex graphs from simpler ones and by revealing structural relationships among different graph classes.
Jinta Jose, Ninu S. Lal, Bobin George
doaj +1 more source
Representable Lexicographic Products
Order, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Minimal cycle bases of the lexicographic product of graphs [PDF]
, 2008 A construction of minimum cycle bases of the lexicographic product of graphs is presented.
Jaradat, M.
core +1 more source
Lexicographic Orders of Intuitionistic Fuzzy Values and Their Relationships
Mathematics, 2019 Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools
Feng Feng +4 more
doaj +1 more source
Rainbow connection number of generalized composition
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a connected graph with . The rainbow connection number is the smallest for which there is a map such that any two vertices can be connected by a path whose edge colors are all distinct.
Fendy Septyanto, Kiki Ariyanti Sugeng
doaj +1 more source
Non-1-Planarity of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2021 In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj +1 more source
Weakened Gallai-Ramsey numbers [PDF]
Surveys in Mathematics and its Applications, 2018 In the Ramsey theory of graphs, one seeks to determine the value of the Ramsey number rt(n), defined to be the least natural number p such that every coloring of the edges of Kp using t colors results in a monochromatic copy of Kn in some color.
Gabrielle Beam, Mark Budden
doaj