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

DOI10.1007/s10878-018-0307-5zbMath1391.05103arXiv1606.03872OpenAlexW2962755022MaRDI QIDQ721930

Zhongmei Qin, Hong Chang, Colton Magnant, Xue Liang Li

Publication date: 20 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.03872

zbMATH Keywords

random graphsthreshold functionproper indexproper tree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((k,\ell)\)-rainbow index of random graphs
• The 3-rainbow index and connected dominating sets
• Note on the upper bound of the rainbow index of a graph
• The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs
• Proper connection of graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• Some upper bounds for the 3-proper index of graphs
• The \(k\)-proper index of graphs
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
• Generalized Connectivity of Graphs
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• Properly Colored Connectivity of Graphs

This page was built for publication: The \((k,\ell )\)-proper index of graphs