IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i2d10.1007_s10878-018-0307-5.html
   My bibliography  Save this article

The $$(k,\ell )$$ ( k , ℓ ) -proper index of graphs

Author

Listed:
  • Hong Chang

    (Nankai University)

  • Xueliang Li

    (Nankai University)

  • Colton Magnant

    (Georgia Southern University)

  • Zhongmei Qin

    (Nankai University)

Abstract

A tree T in an edge-colored graph is called a proper tree if no two adjacent edges of T receive the same color. Let G be a connected graph of order n and k be an integer with $$2\le k \le n$$ 2 ≤ k ≤ n . For $$S\subseteq V(G)$$ S ⊆ V ( G ) and $$|S| \ge 2$$ | S | ≥ 2 , an S-tree is a tree containing the vertices of S in G. A set $$\{T_1,T_2,\ldots ,T_\ell \}$$ { T 1 , T 2 , … , T ℓ } of S-trees is called internally disjoint if $$E(T_i)\cap E(T_j)=\emptyset $$ E ( T i ) ∩ E ( T j ) = ∅ and $$V(T_i)\cap V(T_j)=S$$ V ( T i ) ∩ V ( T j ) = S for $$1\le i\ne j\le \ell $$ 1 ≤ i ≠ j ≤ ℓ . For a set S of k vertices of G, the maximum number of internally disjoint S-trees in G is denoted by $$\kappa (S)$$ κ ( S ) . The k-connectivity $$\kappa _k(G)$$ κ k ( G ) of G is defined by $$\kappa _k(G)=\min \{\kappa (S)\mid S$$ κ k ( G ) = min { κ ( S ) ∣ S is a k-subset of $$V(G)\}$$ V ( G ) } . For a connected graph G of order n and for two integers k and $$\ell $$ ℓ with $$2\le k\le n$$ 2 ≤ k ≤ n and $$1\le \ell \le \kappa _k(G)$$ 1 ≤ ℓ ≤ κ k ( G ) , the $$(k,\ell )$$ ( k , ℓ ) -proper index $$px_{k,\ell }(G)$$ p x k , ℓ ( G ) of G is the minimum number of colors that are required in an edge-coloring of G such that for every k-subset S of V(G), there exist $$\ell $$ ℓ internally disjoint proper S-trees connecting them. In this paper, we show that for every pair of positive integers k and $$\ell $$ ℓ with $$k \ge 3$$ k ≥ 3 and $$\ell \le \kappa _k(K_{n,n})$$ ℓ ≤ κ k ( K n , n ) , there exists a positive integer $$N_1=N_1(k,\ell )$$ N 1 = N 1 ( k , ℓ ) such that $$px_{k,\ell }(K_n) = 2$$ p x k , ℓ ( K n ) = 2 for every integer $$n \ge N_1$$ n ≥ N 1 , and there exists also a positive integer $$N_2=N_2(k,\ell )$$ N 2 = N 2 ( k , ℓ ) such that $$px_{k,\ell }(K_{m,n}) = 2$$ p x k , ℓ ( K m , n ) = 2 for every integer $$n \ge N_2$$ n ≥ N 2 and $$m=O(n^r) (r \ge 1)$$ m = O ( n r ) ( r ≥ 1 ) . In addition, we show that for every $$p \ge c\root k \of {\frac{\log _a n}{n}}$$ p ≥ c log a n n k ( $$c \ge 5$$ c ≥ 5 ), $$px_{k,\ell }(G_{n,p})\le 2$$ p x k , ℓ ( G n , p ) ≤ 2 holds almost surely, where $$G_{n,p}$$ G n , p is the Erdős–Rényi random graph model.

Suggested Citation

  • Hong Chang & Xueliang Li & Colton Magnant & Zhongmei Qin, 2018. "The $$(k,\ell )$$ ( k , ℓ ) -proper index of graphs," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 458-471, August.
  • Handle: RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0307-5
    DOI: 10.1007/s10878-018-0307-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0307-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-018-0307-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Lin & Li, Xueliang & Liu, Jinfeng, 2017. "The k-proper index of graphs," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 57-63.
    2. Li, Shasha & Tu, Jianhua & Yu, Chenyan, 2016. "The generalized 3-connectivity of star graphs and bubble-sort graphs," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 41-46.
    3. Qingqiong Cai & Xueliang Li & Yan Zhao, 2016. "The 3-rainbow index and connected dominating sets," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1142-1159, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Lin & Li, Xueliang & Liu, Jinfeng, 2017. "The k-proper index of graphs," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 57-63.
    2. Catanzaro, Daniele & Frohn, Martin & Gascuel, Olivier & Pesenti, Raffaele, 2023. "A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 2023001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Zhang, Guozhen & Wang, Dajin, 2019. "Structure connectivity and substructure connectivity of bubble-sort star graph networks," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    4. Zhao, Shu-Li & Hao, Rong-Xia & Wei, Chao, 2022. "Internally disjoint trees in the line graph and total graph of the complete bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    5. Gao, Hui & Lv, Benjian & Wang, Kaishun, 2018. "Two lower bounds for generalized 3-connectivity of Cartesian product graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 305-313.
    6. Catanzaro, Daniele & Frohn, Martin & Pesenti, Raffaele, 2021. "A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 2021023, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Ma, Yingbin & Zhu, Wenhan, 2022. "Some results on the 3‐total‐rainbow index," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    8. Catanzaro, Daniele & Frohn, Martin & Gascuel, Olivier & Pesenti, Raffaele, 2022. "A tutorial on the balanced minimum evolution problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 1-19.
    9. Li, Hengzhe & Wang, Jiajia, 2018. "The λ3-connectivity and κ3-connectivity of recursive circulants," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 750-757.
    10. Li, Yinkui & Wei, Liqun, 2023. "Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    11. Catanzaro, Daniele & Frohn, Martin & Gascuel, Olivier & Pesenti, Raffaele, 2021. "A Tutorial on the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 20210, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Li, Shasha & Zhao, Yan & Li, Fengwei & Gu, Ruijuan, 2019. "The generalized 3-connectivity of the Mycielskian of a graph," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 882-890.
    13. Li, Hengzhe & Ma, Yingbin & Yang, Weihua & Wang, Yifei, 2017. "The generalized 3-connectivity of graph products," Applied Mathematics and Computation, Elsevier, vol. 295(C), pages 77-83.
    14. Zhao, Shu-Li & Hao, Rong-Xia, 2019. "The generalized 4-connectivity of exchanged hypercubes," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 342-353.
    15. Mao, Yaping, 2017. "Constructing edge-disjoint Steiner paths in lexicographic product networks," Applied Mathematics and Computation, Elsevier, vol. 308(C), pages 1-10.
    16. Catanzaro, Daniele & Frohn, Martin & Pesenti, Raffaele, 2021. "On Numerical Stability and Statistical Consistency of the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 2021026, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0307-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.