Processing math: 100%
Research article

Solution of the Chen-Chvátal conjecture for specific classes of metric spaces

  • Received: 25 March 2021 Accepted: 13 May 2021 Published: 17 May 2021
  • MSC : Primary 30L99; secondary 05C76

  • In a metric space (X,d), a line induced by two distinct points x,xX, denoted by L{x,x}, is the set of points given by

    L{x,x}={zX:d(x,x)=d(x,z)+d(z,x) or d(x,x)=|d(x,z)d(z,x)|}.

    A line L{x,x} is universal whenever L{x,x}=X.

    Chen and Chvátal [Discrete Appl. Math. 156 (2008), 2101-2108.] conjectured that every finite metric space on n2 points either has at least n distinct lines or has a universal line.

    In this paper, we prove this conjecture for some classes of metric spaces. In particular, we discuss the classes of Cartesian metric spaces, lexicographic metric spaces and corona metric spaces.

    Citation: Juan Alberto Rodríguez-Velázquez. Solution of the Chen-Chvátal conjecture for specific classes of metric spaces[J]. AIMS Mathematics, 2021, 6(7): 7766-7781. doi: 10.3934/math.2021452

    Related Papers:

    [1] Juan Alberto Rodríguez-Velázquez . Corona metric spaces: Basic properties, universal lines, and the metric dimension. AIMS Mathematics, 2022, 7(8): 13763-13776. doi: 10.3934/math.2022758
    [2] Xun Ge, Songlin Yang . Some fixed point results on generalized metric spaces. AIMS Mathematics, 2021, 6(2): 1769-1780. doi: 10.3934/math.2021106
    [3] Yan Han, Shaoyuan Xu, Jin Chen, Huijuan Yang . Fixed point theorems for $ b $-generalized contractive mappings with weak continuity conditions. AIMS Mathematics, 2024, 9(6): 15024-15039. doi: 10.3934/math.2024728
    [4] Naeem Saleem, Salman Furqan, Mujahid Abbas, Fahd Jarad . Extended rectangular fuzzy $ b $-metric space with application. AIMS Mathematics, 2022, 7(9): 16208-16230. doi: 10.3934/math.2022885
    [5] Xiu-Liang Qiu, Selim Çetin, Ömer Kişi, Mehmet Gürdal, Qing-Bo Cai . Octonion-valued $ b $-metric spaces and results on its application. AIMS Mathematics, 2025, 10(5): 10504-10527. doi: 10.3934/math.2025478
    [6] Budi Nurwahyu, Naimah Aris, Firman . Some results in function weighted b-metric spaces. AIMS Mathematics, 2023, 8(4): 8274-8293. doi: 10.3934/math.2023417
    [7] Gonca Durmaz Güngör, Ishak Altun . Fixed point results for almost ($ \zeta -\theta _{\rho } $)-contractions on quasi metric spaces and an application. AIMS Mathematics, 2024, 9(1): 763-774. doi: 10.3934/math.2024039
    [8] Muhammad Riaz, Umar Ishtiaq, Choonkil Park, Khaleel Ahmad, Fahim Uddin . Some fixed point results for ξ-chainable neutrosophic and generalized neutrosophic cone metric spaces with application. AIMS Mathematics, 2022, 7(8): 14756-14784. doi: 10.3934/math.2022811
    [9] Ahmed Alamer, Faizan Ahmad Khan . Boyd-Wong type functional contractions under locally transitive binary relation with applications to boundary value problems. AIMS Mathematics, 2024, 9(3): 6266-6280. doi: 10.3934/math.2024305
    [10] Muhammad Suhail Aslam, Mohammad Showkat Rahim Chowdhury, Liliana Guran, Manar A. Alqudah, Thabet Abdeljawad . Fixed point theory in complex valued controlled metric spaces with an application. AIMS Mathematics, 2022, 7(7): 11879-11904. doi: 10.3934/math.2022663
  • In a metric space (X,d), a line induced by two distinct points x,xX, denoted by L{x,x}, is the set of points given by

    L{x,x}={zX:d(x,x)=d(x,z)+d(z,x) or d(x,x)=|d(x,z)d(z,x)|}.

    A line L{x,x} is universal whenever L{x,x}=X.

    Chen and Chvátal [Discrete Appl. Math. 156 (2008), 2101-2108.] conjectured that every finite metric space on n2 points either has at least n distinct lines or has a universal line.

    In this paper, we prove this conjecture for some classes of metric spaces. In particular, we discuss the classes of Cartesian metric spaces, lexicographic metric spaces and corona metric spaces.



    In a metric space M=(X,dX) a line induced by two distinct points x,xX is defined by

    LM{x,x}={zX:dX(x,x)=dX(x,z)+dX(z,x) or dX(x,x)=|dX(x,z)dX(z,x)|}.

    A line LM{x,x} is universal whenever LM{x,x}=X.

    For instance, if M=Rn is the n-dimensional Euclidean space, then for any pair of points x,x, the metric space obtained from line LRn{x,x}, equipped with its usual metric inherited from Rn, is isometric to the one-dimensional Euclidean space. Hence, the n-dimensional Euclidean space has a universal line if and only if n=1. Now, if a metric space M is equipped with the discrete metric*, then LM{x,x}={x,x} for every pair of points x,xX.

    *The discrete metric is given by d(x,y)=0 if x=y and d(x,y)=1 otherwise.

    There are metric spaces with metrics that may differ from the discrete metric yet generate the same topology. Such spaces are called discrete metric spaces [15], i.e., a metric space M is called a discrete metric space if and only if all its subsets are open (and therefore closed) in M. For instance, the set N of positive integers, with its usual metric inherited from the one-dimensional Euclidean space R, is a discrete metric space; every finite metric space is a discrete metric space; and the vertex set of any connected graph, equipped with the shortest path distance, is a discrete metric space.

    In this context, the following conjecture was stated by Chen and Chvátal [7] for the case of finite metric spaces, where (M) denotes the number of distinct lines in M.

    Conjecture 1.1 (The Chen-Chvátal conjecture, [7]). Every finite metric space M=(X,dX) with at least two points either has a universal line or (M)|X|.

    The Chen-Chvátal conjecture is an attempt to generalize the de Bruijn-Erdős theorem of Euclidean geometry which asserts the following.

    Theorem 1.2 (The de Bruijn-Erdős theorem of Euclidean geometry, [5]). Every non-collinear set of n points in the plane determines at least n distinct lines.

    The Chen-Chvátal conjecture remains open and, as time goes by, the interest of mathematicians to solve it is increasing. Recently, Chvátal [9] described the main progress related to the conjecture, and pointed out twenty-nine related open problems plus three additional conjectures. By way of example, three of these results are presented below.

    Although in the general context of metric spaces the distance function ranges over the nonnegative reals, it was shown by Aboulker and Kapadia [1] that, to prove Conjecture1.1, it is enough to consider metric spaces with integral distances. This motivates to define a k-metric space, with k a positive integer, as a metric space in which all distances are integers and are at most k. Chvátal [8] proved the conjecture for every 2-metric space on n2 points.

    Theorem 1.3. [8] Every 2-metric space on n2 points either has at least n distinct lines or has a universal line.

    Since the vertex set of any connected graph G of diameter D(G), equipped with the shortest path distance, is a D(G)-metric space, Conjecture 1.1 automatically becomes of interest in graph theory. Obviously, Theorem 1.3 includes the case of metric spaces induced by graphs of diameter at most two. We would emphasize that the Chen-Chvátal conjecture was also proved by Beaudou et at. [3] for metric spaces induced by chordal graphs.

    Theorem 1.4. [3] Every metric space induced by a chordal graph on n vertices, where n2, either has at least n distinct lines or has a universal line.

    Aboulker and Kapadia [1] proved the Chen-Chvátal conjecture for the case of metric spaces induced by distance-hereditary graphs.

    Theorem 1.5. [1] Every metric space induced by a connected distance-hereditary graph on n vertices, where n2, either has at least n distinct lines or has a universal line.

    After that, Aboulker et al. [2] proved the Chen-Chvátal conjecture for metric spaces induced by a family of graphs containing chordal graphs and distance-hereditary graphs, Schrader and Stenmans [16] proved the conjecture for the case of (q,q4)-graphs, and Beaudou et al. [4] proved it for the case of bisplit graphs.

    In this paper, we prove the Chen-Chvátal conjecture for some classes of metric spaces. Specifically, Section 2 is devoted to lexicographic metric spaces, Section 3 is devoted to corona metric spaces, while in Section 4 we discuss the case of Cartesian metric spaces.

    Given a metric space M=(X,dX), and a point xX, we define the nearness of x to be

    η(x)=inf{dX(x,y):yX{x}}.

    We define the nearness of the metric space to be

    η(M)=inf{η(x):xX}.

    Obviously, if M is the metric space induced by a simple graph G, then η(M)=1=η(x) for every vertex x of G.

    Definition 2.1. [12] Let M=(X,dX) and M=(Y,dY) be two metric spaces such that η(M)>0. A map ρ:(X×Y)×(X×Y)R defined by

    ρ((x,y),(x,y))={dX(x,x),if xx,min{2η(x),dY(y,y)},if x=x.

    is called a lexicographic distance, and the metric space MM=(X×Y,ρ) is called a lexicographic metric space.

    The study of lexicographic metric spaces was introduced by Rodríguez-Velázquez [12], where the author discussed some basic properties of these metric spaces, such as completeness, boundedness, compactness and separability. Furthermore, the author gave a formula for the metric dimension of any lexicographic metric space.

    Given a metric space M=(X,dX), the image of dX will be denoted by Im(dX). The diameter of a finite metric space M=(X,dx) is defined to be

    D(M)=max{dX(v,w):v,wX},

    and the eccentricity of a point xX is defined to be

    εM(x)=max{dX(x,u):uX}.

    In this section we discuss the class of finite lexicographic metric spaces MM with the restriction on M=(X,dX) that η(x)=1 for every xX. We first consider the case where D(M)2.

    Theorem 2.1. Let M=(X,dX) be a finite 2-metric space such that η(x)=1 for every xX, and let M=(Y,dY) be a finite metric space. If (0,2)Im(dY){1}, then either MM has a universal line or (MM)|X×Y|.

    Proof. Notice that |X|2, as η(x)=1 for every xX. We differentiate two cases for any pair (x,y),(a,b)X×Y of different points of MM.

    Case 1. xa. In this case, ρ((x,y),(a,b))=dX(x,a){1,2}, as M is a 2-metric space.

    Case 2. x=a. If (0,2)Im(dY){1}, then ρ((x,y),(a,b))=min{2,dY(y,b)}{1,2}, as η(x)=1 for every xX.

    According to the two cases above, MM is a finite 2-metric space. Therefore, the result follows by Theorem 1.3.

    To continue with our analysis, we need to prove the following lemma.

    Lemma 2.2. Let M=(X,dX) be a metric space such that η(M)>0 and let M=(Y,dY) be a metric space. If x,x,xX are three different points of M and there exist y,y,yY such that (x,y)LMM{(x,y),(x,y)}, then {x}×YLMM{(x,y),(x,y)}.

    Proof. Assume (x,y)LMM{(x,y),(x,y)}, i.e.,

    ρ((x,y),(x,y))=ρ((x,y),(x,y))+ρ((x,y),(x,y))

    or

    ρ((x,y),(x,y))=|ρ((x,y),(x,y))ρ((x,y),(x,y))|.

    Hence, if x,x,xX are three different points of M, then for any zY, either

    ρ((x,y),(x,y))=ρ((x,y),(x,y))+ρ((x,y),(x,y))=dX(x,x)+dX(x,x)=ρ((x,y),(x,z))+ρ((x,z),(x,y))

    or, by analogy,

    ρ((x,y),(x,y))=|ρ((x,y),(x,z))ρ((x,z),(x,y))|.

    Therefore, (x,z)LMM{(x,y),(x,y)} for every zY, as required.

    We will use the term integral metric spaces to refer to k-metric spaces in contexts where the value of k is irrelevant. Therefore, Im(dX)Z for every integral metric space M=(X,dX). Next we consider the class of finite lexicographic metric spaces MM where D(M)3 and η(x)=1 for every xX. In this case, the only restriction on M=(Y,dY) is that 2|Y|<+.

    Theorem 2.3. Let M=(X,dX) be a finite integral metric space such that η(x)=1 for every xX. Let M=(Y,dY) be a finite metric space with |Y|2. If D(M)3, then either MM has a universal line or (MM)|X×Y|.

    Proof. If D(M)3, then εM(x)2 for every xX, as dX(v,x)+dX(x,w)dX(v,w)=D(M)3 for every pair v,wX of antipodal points of M. Thus, for every point xX we can choose one point xX such that dX(x,x)2. We claim that the following fact holds.

    Fact 1: For any x,xX with dX(x,x)2 and y,yY,

    {x}×YLMM{(x,y),(x,y)}={(x,y)}.

    In order to prove Fact 1, notice that for any zY{y},

    ρ((x,y),(x,y))=ρ((x,z),(x,y))=dX(x,x)2 (2.1)

    and, since η(x)=1,

    ρ((x,y),(x,z))=min{2,dY(y,z)}>0. (2.2)

    From (2.1) and (2.2) we deduce that

    ρ((x,y),(x,y))|ρ((x,y),(x,z))±ρ((x,z),(x,y))|,

    and so (x,z)LMM{(x,y),(x,y)}, which completes the proof of Fact 1.

    Obviously, from Fact 1 we derive the following consequence.

    Fact 2: Given a,a,b,bY and x,xX with dX(x,x)2, the following statements are equivalent.

    LMM{(x,a),(x,a)}=LMM{(x,b),(x,b)}.

    a=b and a=b.

    Now, we claim that the following fact holds.

    Fact 3: If there exist (u,v),(u,v),(x,y),(x,y)X×Y such that dX(x,x)2, dX(u,u)2 and LMM{(x,y),(x,y)}=LMM{(u,v),(u,v)}, then {x,x}={u,u}.

    Suppose to the contrary that x{u,u}. Under this assumption, u,u and x are three different points of M, and since (x,y)LMM{(x,y),(x,y)}=LMM{(u,v),(u,v)}, by Lemma 2.2 we deduce that {x}×YLMM{(u,v),(u,v)}=LMM{(x,y),(x,y)}, which contradicts Fact 1, as |Y|2. Hence, x{u,u} and analogously, x{u,u}. Thus, Fact 3 follows.

    From Fact 2 we can conclude that for every x,xX with dX(x,x)2, there exist |Y|2 different lines in MM which are generated by one point in {x}×Y and one point in {x}×Y. Therefore, Fact 3 leads to

    (MM)12|X||Y|2|X||Y|=|X×Y|,

    as required.

    Notice that in the proof of Theorem 2.3 we have solved the problem without worrying about the existence of universal lines. In fact, the problem of investigating the properties of metric spaces M=(X,dX) having a universal line is very interesting, even if we can check that (M)|X|. Recently, Rodríguez-Velázquez [13] discussed the problem for the particular case of metric spaces induced by graphs.

    Figure 1 shows the sketch of two integral metric spaces M=(X,dX) and M=(Y,dY), where X={a,b,c,d} and Y={a,b,c,d}. It is easy to check that for any u,vY, the line LMM{(a,u),(d,v)}=X×Y is universal. Furthermore, D(M)=3 and, by the procedure described in the proof of Theorem 2.3, (MM)12|X||Y|2=32>16=|X||Y|.

    Figure 1.  Sketch of two integral metric spaces. On the left, a metric space M=(X,dX) where X={a,b,c,d} and η(x)=1 for every xX. On the right, a metric space M=(Y,dY) where Y={a,b,c,d} and η(M)=η(b)=η(c)=2.

    As mentioned above, Aboulker and Kapadia [1] observed that to prove the Chen-Chvátal conjecture it is enough to consider integral metric spaces. In this sense, we can say that we have solved the conjecture for any finite lexicographic metric space MM with the only restriction that η(x)=1 for every point x of M. We would highlight this fact in the following theorem, which is obtained from Theorems 2.1 and 2.3.

    Theorem 2.4. If MM=(X×Y,ρ) is a finite and integral lexicographic metric space, where |Y|2 and η(x)=1 for every point xX, then either MM has a universal line or (MM)|X×Y|.

    The notion of lexicographic metric space was inspired by the concept of lexicographic product graph [12]. The lexicographic product GH of two graphs G and H is the graph whose vertex set is V(GH)=V(G)×V(H) and (u,v)(x,y)E(GH) if and only if uxE(G) or u=x and vyE(H). For basic properties of the lexicographic product of two graphs we suggest the books [10,11].

    A lexicographic product graph GH is connected if and only if G is connected. We denote by dG the shortest path distance of any graph G. As observed in [12], given a connected (simple) graph G and a non-necessarily connected (simple) graph H, the graph GH induces a lexicographic metric space MM, which is obtained from the metric space M, induced by G, and the metric space M=(V(H),d), where d(y,y)=min{2,dH(y,y)}. Notice that the distance function d is well defined, even if H is not connected, in the sense that for two vertices y and y belonging to different components of H we assume that dH(y,y)=+, and so d(y,y)=min{2,dH(y,y)}=min{2,+}=2. In summary, the class of lexicographic metric spaces includes, but is not limited to, the class of metric spaces induced by lexicographic product graphs. Therefore, the following result is a particular case of Theorem 2.4.

    Corollary 2.5. Every metric space induced by a lexicographic product graph GH, where |V(G)|2 and |V(H)|2, either has at least |V(GH)| distinct lines or has a universal line.

    The study of corona metric spaces was introduced by Rodríguez-Velázquez [14], where the author discussed some basic properties of these metric spaces, such as completeness, boundedness, compactness and separability. Furthermore, the author gave a formula for the metric dimension of any corona metric space.

    Definition 3.1. [14] Let M=(X,dX) be a metric space with 0<η(M)<+ and M a family of pairwise disjoint metric spaces such that there exists a bijection f:XM. Let f(x)=Mx=(Xx,dXx) for every xX, and

    U=X(xXXx).

    Let dU:U×UR be the map defined by

    dU(a,b)={dX(a,b),if a,bX,η(x)+dX(x,x),if aXx and b=xX,η(x)+dX(x,x)+η(x),if aXx and bXx,min{2η(x),dXx(a,b)},if a,bXx.

    The map dU is called a corona distance, and the metric space MfM=(U,dU) is called a corona metric space.

    One can easily check the distance function dU is well defined, i.e., MfM=(U,dU) is a metric space. Notice that the requirement η(M)<+ is needed, as inf=+. Hence, if |X|=1, then η(M)=+. Therefore, the requirement η(M)<+ is equivalent to |X|2.

    As we will see below, the class of corona metric spaces includes, but is not limited to, the class of metric spaces induced by corona graphs.

    Theorem 3.1. Every finite corona metric space MfM=(U,dU) has a universal line or (MfM)|U|.

    Proof. If X={x,x}, then for any yXx we have dU(y,x)=dU(y,x)+dU(x,x), and for any zXx we have dU(z,x)=dU(z,x)+dU(x,x). Therefore, LMfM{x,x}=XxXXx=U is a universal line.

    Now, if there exists xX such that |Xx|=1, say Xx={y}, then for any zU{y} we have dU(z,y)=dU(z,x)+dU(x,y). Therefore, LMfM{x,y} is a universal line.

    From now on, assume that |X|3 and |Xx|2 for every xX. Given two different points a,bU, we define

    [a,b]={zU:dU(a,b)=dU(a,z)+dU(z,b)}.

    Notice that [x,x]X for every x,xX, and [x,y]={x,y} for every xX and yXx. Hence, for any pair of different points x,xX, and any aXx and bXx,

    [a,b]=[a,x][x,x][x,b]={a}[x,x]{b},

    and so

    LMfM{a,b}={a}[x,x]{b}.

    This implies that for every pair of distinct points x,xX there exist |Xx||Xx| different lines of MfM which are generated by one point in Xx and the other one in Xx.

    Since |X|3, and |Xx|2 for every xX, we can choose three different points u,v,wX such that 2|Xu|=min{|Xx|:xX}, and so

    (MfM)x,xX,xx|Xx||Xx||Xv||Xw|+xX{u}|Xx||Xu||Xu|xX|Xx|2xX|Xx|xX(|Xx|+1)=|U|.

    Therefore, the result follows.

    Let G be a connected graph, H a family of pairwise disjoint graphs with |H|=|V(G)|, and g:V(G)H a bijection. Let g(x)=Hx for every xV(G). We define the generalized corona graph GgH as the graph obtained from G, H and g, by taking one copy of G and one copy of each graph in H, and making x adjacent to every vertex of Hx for every xV(G). Notice that GgH is connected if and only if G is connected. If there exists a graph H such that g(x)=Hx is isomorphic to H for every xV(G), then GgHGH is a standard corona graph, as defined in 1970 by Frucht and Harary [6].

    It is not difficult to check that if |V(G)|2, then the metric space induced by a generalized corona graph GgH is a corona metric space MfM constructed from M=(X,dX)=(V(G),dG) and f(x)=Mx=(Xx,dXx)M for every xV(G), where Xx=V(Hx) and dXx(y,y)=min{2,dHx(y,y)}. As we can expect, if there exists xV(G) such that g(x)=Hx is not connected, then for two vertices y and y belonging to different components of Hx we assume that dHx(y,y)=+, and so dXx(y,y)=min{2,dHx(y,y)}=min{2,+}=2.

    In other words, if G is a connected graph with at least two vertices, then the geodesic distance of a generalized corona graph GgH induces a corona distance.

    Theorem 3.2. Every metric space induced by a generalized corona graph on n vertices, where n2, either has at least n distinct lines or has a universal line.

    Proof. Let GgH be a generalized corona graph, where G is connected. We first consider the cases in which |V(G)|=1. If GK1 and H={H}, then the graph K1gH, which is in fact the join graph K1+H, is included in the class of graphs of diameter at most two. Therefore, by Theorem 1.3, the metric space induced by K1gH, either has at least |V(H)|+1 distinct lines or has a universal line.

    Now, if |V(G)|2 then the metric space induced by GgH is a corona metric space, and so the result follows by Theorem 3.1.

    It is well known that there are many ways to endow a metric on a product of two metric spaces. In general, there is no reason why an arbitrary metric on a product should have a clear relationship to the metrics of the individual spaces. Instead, if the metric on the product space preserves the metrics on the projection subspaces, then one can expect that some properties of the individual spaces can be carried over to the product space. In this section we consider a particular case of these conservative metrics.

    Let M=(X,dX) and M=(Y,dY) be two metric spaces. The Cartesian metric space MM=(X×Y,μ) is equipped with the metric,

    μ((x,y),(x,y))=dX(x,x)+dY(y,y) for every (x,y),(x,y)X×Y.

    Obviously, MM is isometric to MM. Furthermore, the subspace of MM induced by X×{y} is isometric to M for every yY, and the subspace induced by {x}×Y is isometric to M for every xX.

    Given a metric space M=(X,dX) and two different points a,bX, we define

    [a,b]={cX:dX(a,b)=dX(a,c)+dX(c,b)}.

    a,b=[a,b]{a,b}.

    [a,b]={cX:dX(c,b)=dX(c,a)+dX(a,b)}.

    Notice that for every a,bX, with ab,

    LM{a,b}=[a,b][a,b][b,a].

    To ease the proof of our results, we need to establish the following four lemmas.

    Lemma 4.1. Let M=(X,dX) and M=(Y,dY) be two metric spaces. For any x,xX, with xx, and any yY,

    LMM{(x,y),(x,y)}=(LM{x,x}x,x)×Yx,x×{y}.

    Proof. Let x,xX be two different points, let yY and (a,b)X×Y. We differentiate the following cases for x,x and a.

    Case 1. a[x,x]. In this case,

    μ((a,b),(x,y))=dX(a,x)+dY(b,y)=dX(a,x)+dX(x,x)+dY(b,y)=dX(a,x)+dY(b,y)+dX(x,x)+dY(y,y)=μ((a,b),(x,y))+μ((x,y),(x,y)).

    Hence, (a,b)[(x,y),(x,y)].

    Case 2. a[x,x]. By analogy to Case 1 we conclude that (a,b)[(x,y),(x,y)].

    Case 3. ax,x. In this case,

    μ((x,y),(x,y))=dX(x,x)=dX(x,a)+dX(a,x)=μ((x,y),(a,y))+μ((a,y),(x,y)).

    Therefore, (a,y)(x,y),(x,y).

    From Cases 1 and 2 we deduce that

    (LM{x,x}x,x)×YLMM{(x,y),(x,y)},

    while from Case 3 we deduce that

    x,x×{y}LMM{(x,y),(x,y)}.

    Now, we differentiate the following three cases for (x,y),(x,y) and (a,b).

    Case 1'. (a,b)[(x,y),(x,y)]. In this case,

    dX(a,x)+dY(b,y)=μ((a,b),(x,y))=μ((a,b),(x,y))+μ((x,y),(x,y))=dX(a,x)+dY(b,y)+dX(x,x).

    Hence, dX(a,x)=dX(a,x)+dX(x,x), i.e., a[x,x].

    Case 2'. (a,b)[(x,y),(x,y)]. By analogy to Case 1' we conclude that a[x,x].

    Case 3'. (a,b)(x,y),(x,y). In this case,

    dX(x,x)=μ((x,y),(x,y))=μ((x,y),(a,b))+μ((a,b),(x,y))=dX(x,a)+2dY(b,y)+dX(a,x)dX(x,x)+2dY(b,y).

    Therefore, (a,b)(x,y),(x,y) if and only if b=y and ax,x.

    According to Cases 1' and 2' we conclude that

    LMM{(x,y),(x,y)}(x,y),(x,y)(LM{x,x}x,x)×Y,

    while from Case 3' we deduce that

    LMM{(x,y),(x,y)}(x,y),(x,y)=(x,y),(x,y)=x,x×{y}.

    Therefore, the result follows.

    Lemma 4.2. Let M=(X,dX) and M=(Y,dY) be two metric spaces. For any x,xX and y,yY such that xx and yy,

    [(x,y),(x,y)]=[x,x]×[y,y].

    Proof. If (a,b)[x,x]×[y,y], then dX(a,x)=dX(a,x)+dX(x,x) and dY(b,y)=dY(b,y)+dY(y,y). Hence,

    μ((a,b),(x,y))=dX(a,x)+dY(b,y)=dX(a,x)+dX(x,x)+dY(b,y)+dY(y,y)=μ((a,b),(x,y))+μ((x,y),(x,y)).

    Therefore, (a,b)[(x,y),(x,y)], which implies that [x,x]×[y,y][(x,y),(x,y)].

    Now, let (u,v)X×Y such that u[x,x]. In this case, dX(u,x)<dX(u,x)+dX(x,x). Since dY(v,y)dY(v,y)+dY(y,y), we have

    μ((u,v),(x,y))=dX(u,x)+dY(v,y)<dX(u,x)+dX(x,x)+dY(v,y)+dY(y,y)=μ((u,v),(x,y))+μ((x,y),(x,y)).

    Hence, (u,v)[(x,y),(x,y)]. Analogously, if v[y,y], then (u,v)[(x,y),(x,y)]. Therefore, [(x,y),(x,y)]=[x,x]×[y,y].

    Lemma 4.3. Let M=(X,dX) and M=(Y,dY) be two metric spaces. For any x,xX and y,yY such that xx and yy,

    [(x,y),(x,y)]=[x,x]×[y,y].

    Proof. If (a,b)[x,x]×[y,y], then dX(x,x)=dX(x,a)+dX(a,x) and dY(y,y)=dY(y,b)+dY(b,y). Hence,

    μ((x,y)(x,y))=dX(x,x)+dY(y,y)=dX(x,a)+dX(a,x)+dY(y,b)+dY(b,y)=μ((x,y)(a,b))+μ((a,b)(x,y)).

    Therefore, (a,b)[(x,y),(x,y)], and so [x,x]×[y,y][(x,y),(x,y)].

    Now, let (u,v)X×Y such that u[x,x]. In this case, dX(x,x)<dX(x,u)+dX(u,x). Since dY(y,y)dY(y,v)+dY(v,y), we have

    μ((x,y),(x,y))=dX(x,x)+dY(y,y)<dX(x,u)+dX(u,x)+dY(y,v)+dY(v,y)=μ((x,y),(u,v))+μ((u,v),(x,y)).

    Hence, from u[x,x] we infer (u,v)[(x,y),(x,y)]. Analogously, if v[y,y], then (u,v)[(x,y),(x,y)]. Therefore, [(x,y),(x,y)]=[x,x]×[y,y].

    From Lemmas 4.2 and 4.3 we deduce the following result.

    Lemma 4.4. Let M=(X,dX) and M=(Y,dY) be two metric spaces. For any x,xX and y,yY such that xx and yy,

    LMM{(x,y),(x,y)}=[x,x]×[y,y][x,x]×[y,y][x,x]×[y,y].

    The following theorem provides a necessary and sufficient condition for the existence of universal lines in Cartesian metric spaces.

    Theorem 4.5. If M=(X,dX) and M=(Y,dY) are metric spaces with |X|2 and |Y|2, then the Cartesian metric space MM has a universal line if and only if one of the following conditions holds.

    (i) There exist two points x,xX such that x,x= and LM{x,x} is universal or there exist two points y,yY such that y,y= and LM{y,y} is universal.

    (ii) There exist two points x,xX such that [x,x]=X and there exist two points y,yY such that [y,y]=Y.

    Proof. As usual, symmetric cases will be omitted. If there exist two points x,xX such that x,x= and LM{x,x} is universal, then by Lemma 4.1 we have that for any yY, LMM{(x,y),(x,y)}=LM{x,x}×Y=X×Y.

    Now, if there exist two points x,xX such that [x,x]=X and there exist two points y,yY such that [y,y]=Y, then Lemma 4.4 leads to LMM{(x,y),(x,y)}=X×Y.

    Conversely, assume that there exist two distinct points (x,y),(x,y)X×Y such that LMM{(x,y),(x,y)} is universal. We differentiate the following two cases.

    Case 1. y=y. In this case xx and, by Lemma 4.1 we have

    LMM{(x,y),(x,y)}=(LM{x,x}x,x)×Yx,x×{y}=X×Y.

    Therefore, LM{x,x}=X and x,x=, as required.

    Case 2. xx and yy. By Lemma 4.4 we have

    LMM{(x,y),(x,y)}=[x,x]×[y,y][x,x]×[y,y][x,x]×[y,y]=X×Y.

    Now, if there exists x0[x,x]{x}, then (x0,y)LMM{(x,y),(x,y)}, which is a contradiction. Hence, [x,x]={x} and, analogously, [x,x]={x}, [y,y]={y} and [y,y]={y}. Therefore, [x,x]=X and [y,y]=Y, as required.

    To continue the study we need to state the following lemmas.

    Lemma 4.6. Let M=(X,dX) be a metric space. If there exist a,b,u,vX such that {a,b}{u,v}, a,b and u,v, then LM{a,b}LM{u,v} or a,bu,v.

    Proof. Suppose to the contrary that LM{a,b}=LM{u,v} and a,b=u,v. Under these assumptions, u,vLM{a,b} and we can assume, without loss of generality, that u[a,b]. Hence, for any xa,b=u,v,

    dX(u,b)=dX(u,a)+dX(a,b)=dX(u,a)+dX(a,x)+dX(x,b),

    and so

    dX(u,x)=dX(u,a)+dX(a,x). (4.1)

    With this fact in mind, we differentiate two cases.

    Case 1. v[a,b]. In this case, for any xa,b=u,v,

    dX(v,b)=dX(v,a)+dX(a,b)=dX(v,a)+dX(a,x)+dX(x,b).

    Hence,

    dX(v,x)=dX(v,a)+dX(a,x). (4.2)

    Thus, by (4.1) and (4.2),

    dX(u,v)=dX(u,x)+dX(x,v)=dX(u,a)+dX(a,x)+dX(v,a)+dX(a,x)dX(u,v)+2dX(a,x),

    which is a contradiction, as ax.

    Case 2. v[b,a]. In this case, for any xa,b=u,v,

    dX(v,a)=dX(v,b)+dX(b,a)=dX(v,b)+dX(b,x)+dX(x,a).

    Hence,

    dX(v,x)=dX(v,b)+dX(b,x). (4.3)

    Thus, by (4.1) and (4.3),

    dX(u,v)=dX(u,x)+dX(x,v)=dX(u,a)+dX(a,x)+dX(x,b)+dX(b,v)=dX(u,a)+dX(a,b)+dX(b,v),

    which is a contradiction, as {a,b}u,v= and {a,b}{u,v}.

    Lemma 4.7. Let M=(X,dX) and M=(Y,dY) be two metric spaces where |X|2 and |Y|2. If there exist a,b,u,vX such that {a,b}{u,v}, a,b and u,v, then for any yY,

    LMM{(a,y),(b,y)}LMM{(u,y),(v,y)}.

    Proof. Suppose, to the contrary, that LMM{(a,y),(b,y)}=LMM{(u,y),(v,y)}. Since |Y|2, Lemma 4.1 leads to LM{a,b}=LM{u,v} and a,b=u,v, which contradicts Lemma 4.6. Therefore, the result follows.

    The following result shows that if the number of lines of a metric space M is at least the number of points, then for any finite metric space M, the number of lines of MM is at least the number of points.

    Theorem 4.8. Let M=(X,dX) and M=(Y,dY) be two metric spaces. If (M)|X| or (M)|Y|, then (MM)|X×Y|.

    Proof. Assume (M)|X|. Let yY and a,b,u,vX such that LM{a,b}LM{u,v}. We differentiate the following three cases.

    Case 1. a,b=u,v=. By Lemma 4.1,

    LMM{(a,y),(b,y)}=LM{a,b}×YLM{u,v}×Y=LMM{(u,y),(v,y)}.

    Case 2. a,b= and u,v. By Lemma 4.1,

    LMM{(a,y),(b,y)}=LM{a,b}×Y(LM{u,v}u,v)×Yu,v×{y}=LMM{(u,y),(v,y)}.

    Notice that we reach the same conclusion whether |Y|2 or |Y|=1.

    Case 3. a,b and u,v. In this case Lemma 4.7 leads to

    LMM{(a,y),(b,y)}LMM{(u,y),(v,y)}.

    According to the three cases above, (MM)(M)|Y||X||Y|=|X×Y|.

    Next we present the case in which the metric spaces M and M are integral and for each point of these spaces there is another point at distance one.

    Theorem 4.9. Let M=(X,dX) and M=(Y,dY) be two finite and integral metric spaces. If η(x)=1 for every xX and η(y)=1 for every yY, then the Cartesian metric space MM has a universal line or (MM)|X×Y|.

    Proof. If |X|=2 or |Y|=2, then the result follows by Theorem 4.5. From now on we assume that |X|3 and |Y|3.

    We differentiate the following cases for the diameter of M and M.

    Case 1. D(M)2 and D(M)2. If D(M)=1, then by Lemma 4.1, LMM{(x,y),(x,y)}={x,y}×Y for every yY and x,xX with xx. Hence,

    (MM)(|X|2)|Y|=|X|(|X|1)2|Y||X||Y|.

    Now, if D(M)3 and D(M)3, then for every xX there exists xX{x} such that x,x, as η(x)=1. Analogously, for every yY there exists yY{y} such that y,y. Thus, Lemma 4.7 leads to

    (MM)|X|2|Y|+|Y|2|X|=|X||Y|.

    Case 2. D(M)=D(M)=2. By Theorem 1.3, we have that M has a universal line or (M)|X|. Likewise, M has a universal line or (M)|Y|.

    Let x,xX and y,yY such that xx and yy. Observe that if LM{x,x}=X, then x,x= or [x,x]=X, as D(M)=2.

    Hence, if LM{x,x}=X and x,x= or LM{y,y}=Y and y,y=, then by Theorem 4.5 we conclude that MM has a universal line.

    Now, if LM{x,x}=X=[x,x] and LM{y,y}=Y=[y,y], then by Lemma 4.3 we have LMM{(x,y),(x,y)}=X×Y.

    Finally, if (M)|X| or (M)|Y|, then Theorem 4.8 leads to (MM)|X||Y|.

    We recall that the Cartesian product of two graphs G and H is the graph GH, such that V(GH)=V(G)×V(H) and two vertices (g,h),(g,h) are adjacent in GH if and only if, either g=g and hhE(H) or h=h and ggE(G). For basic properties of the Cartesian product of two graphs we suggest the books [10,11].

    It is well known that the distance between two vertices (g,h) and (g,h) is given by

    dGH((g,h),(g,h))=dG(g,g)+dH(h,h).

    Hence, if G and H are two connected graphs, then the metric space induced by the Cartesian product graph GH is the Cartesian metric space MM=(X×Y,μ), where X=V(G) is the vertex set of G and Y=V(H) is the vertex set of H. Therefore, the following result is a particular case of Theorem 4.9.

    Corollary 4.10. If G and H are two connected graphs with at least two vertices, then the metric space induced by the Cartesian product graph GH has a universal line or (GH)|V(G)||V(H)|.

    The author would like to thank Abel Cabrera Martínez for the exchange of ideas on this subject.

    The author declares no conflicts of interest in this paper.



    [1] P. Aboulker, R. Kapadia, The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs, Eur. J. Combin., 43 (2015), 1–7. doi: 10.1016/j.ejc.2014.06.009
    [2] P. Aboulker, M. Matamala, P. Rochet, J. Zamora, A new class of graphs that satisfies the Chen-Chvátal conjecture, J. Graph Theory, 87 (2018), 77–88. doi: 10.1002/jgt.22142
    [3] L. Beaudou, A. Bondy, X. Chen, E. Chiniforooshan, M. Chudnovsky, V. Chvátal, et al. A De Bruijn–Erdős theorem for chordal graphs, Electron. J. Comb., 22 (2015), 1–70.
    [4] L. Beaudou, G. Kahn, M. Rosenfeld, Bisplit graphs satisfy the Chen-Chvátal conjecture, Discrete Math. Theor. Comput. Sci., 21 (2019), 1–22.
    [5] N. G. de Bruijn, P. Erdős, On a combinatorial problem, Indagationes Math., 10 (1948), 421–423.
    [6] R. Frucht, F. Harary, On the corona of two graphs, Aequationes Math., 4 (1970), 322–325.
    [7] X. Chen, V. Chvátal, Problems related to a de Bruijn-Erdős theorem, Discrete Appl. Math., 156 (2008), 2101–2108. doi: 10.1016/j.dam.2007.05.036
    [8] V. Chvátal, A de Bruijn-Erdős theorem for 1-2 metric spaces, Czechoslovak Math. J., 64 (2014), 45–51. doi: 10.1007/s10587-014-0081-1
    [9] V. Chvátal, A de Bruijn-Erdős theorem in graphs? In: Graph theory–-favorite conjectures and open problems. 2, Probl. Books in Math., Springer, Cham, 2018, pp. 149–176.
    [10] R. Hammack, W. Imrich, S. Klavžar, Handbook of product graphs, 2nd ed., CRC Press, 2011.
    [11] W. Imrich, S. Klavžar, Product graphs, structure and recognition, Wiley-Interscience series in discrete mathematics and optimization, Wiley, 2000.
    [12] J. A. Rodríguez-Velázquez, Lexicographic metric spaces: basic properties and the metric dimension, Appl. Anal. Discrete Math., 14 (2020), 20–32. doi: 10.2298/AADM180627004R
    [13] J. A. Rodríguez-Velázquez, Universal lines in graphs. Submitted.
    [14] J. A. Rodríguez-Velázquez, Corona metric spaces: basic properties, universal lines, and the metric dimension. Submitted.
    [15] M. Ó Searcóid, Metric spaces, Springer Undergraduate Mathematics Series, Springer-Verlag London, Ltd., London, 2007.
    [16] R. Schrader, L. Stenmans, A de Bruijn-Erdős theorem for (q,q4)-graphs, Discrete Appl. Math., 279 (2020), 198–201. doi: 10.1016/j.dam.2019.11.008
  • This article has been cited by:

    1. Juan Alberto Rodríguez-Velázquez, Corona metric spaces: Basic properties, universal lines, and the metric dimension, 2022, 7, 2473-6988, 13763, 10.3934/math.2022758
    2. Adrià Gispert-Fernández, Juan Alberto Rodríguez-Velázquez, The equidistant dimension of graphs: NP-completeness and the case of lexicographic product graphs, 2024, 9, 2473-6988, 15325, 10.3934/math.2024744
    3. Vašek Chvátal, Ida Kantor, Metric hypergraphs and metric-line equivalences, 2023, 0012365X, 113473, 10.1016/j.disc.2023.113473
    4. Luis Pedro Montejano, Chen-Chvátal’s conjecture for graphs with restricted girth, 2024, 47, 1607-3606, 1827, 10.2989/16073606.2024.2345846
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2461) PDF downloads(67) Cited by(4)

Figures and Tables

Figures(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog