IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v296y2017icp57-63.html
   My bibliography  Save this article

The k-proper index of graphs

Author

Listed:
  • Chen, Lin
  • Li, Xueliang
  • Liu, Jinfeng

Abstract

A tree T in an edge-colored graph is a proper tree if any two adjacent edges of T are colored with different colors. Let G be a graph of order n and k be a fixed integer with 2 ≤ k ≤ n. For a vertex set S ⊆ V(G), a tree containing the vertices of S in G is called an S-tree. An edge-coloring of G is called a k-proper coloring if for every set S of k vertices in G, there exists a proper S-tree in G. The k-proper index of a nontrivial connected graph G, denoted by pxk(G), is the smallest number of colors needed in a k-proper coloring of G. In this paper, we state some simple observations about pxk(G) for a nontrivial connected graph G. Meanwhile, the k-proper indices of some special graphs are determined, and for every pair of positive integers a, b with 2 ≤ a ≤ b, a connected graph G with pxk(G)=a and rxk(G)=b is constructed for each integer k with 3 ≤ k ≤ n. Also, we characterize the graphs with k-proper index n−1 and n−2, respectively.

Suggested Citation

  • Chen, Lin & Li, Xueliang & Liu, Jinfeng, 2017. "The k-proper index of graphs," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 57-63.
    • Handle: RePEc:eee:apmaco:v:296:y:2017:i:c:p:57-63
    DOI: 10.1016/j.amc.2016.10.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316306233
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.10.025?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. 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.
    2. Li, Shasha & Li, Xueliang & Shi, Yongtang, 2015. "Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 155-161.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.

    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. 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.
    2. Li, Jingjian & Xu, Shangjin & Cao, Mengyue & Kang, Zhe, 2017. "On tetravalent symmetric dihedrants," Applied Mathematics and Computation, Elsevier, vol. 306(C), pages 49-55.
    3. Yue, Jun & Zhang, Shiliang & Zhang, Xia, 2016. "Note on the perfect EIC-graphs," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 481-485.
    4. Ma, Yingbin & Zhu, Wenhan, 2022. "Some results on the 3‐total‐rainbow index," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    5. Li, Jing Jian & Ling, Bo & Liu, Guodong, 2018. "A characterisation on arc-transitive graphs of prime valency," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 227-233.
    6. Yongtang Shi & Meiqin Wei & Jun Yue & Yan Zhao, 2017. "Coupon coloring of some special graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 156-164, January.

    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:eee:apmaco:v:296:y:2017:i:c:p:57-63. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.