Note on directed proper connection number of a random graph

DOI10.1016/j.amc.2019.05.028zbMath1428.05105OpenAlexW2947136787MaRDI QIDQ2279590

Ran Gu, Rui Li, Bo Deng

Publication date: 13 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.05.028

zbMATH Keywords

random graphsdirected graphsdirected proper connection number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Proper-walk connection of Hamiltonian digraphs ⋮ (Strong) proper vertex connection of some digraphs ⋮ Proper connection and proper-walk connection of digraphs

Cites Work

• Characterizations of graphs having large proper connection numbers
• Proper connection of graphs
• Proper connection number of random graphs
• Hamiltonian circuits determining the order of chromosomes
• Total rainbow connection of digraphs
• Rainbow vertex connection of digraphs
• The transitive closure of a random digraph
• On the strength of connectedness of a random graph
• General percolation and random graphs
• The Strength of Connectivity of a Random Graph
• Properly Colored Connectivity of Graphs
• Paths in graphs
• Random Graphs
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• On the (di)graphs with (directed) proper connection number two
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on directed proper connection number of a random graph