Note on directed proper connection number of a random graph

DOI10.1016/J.AMC.2019.05.028MaRDI QIDQ2279590zbMATH OpenOpenAlexFDO

Authors Ran Gu, Bo Deng, Rui Li

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

directed graphsrandom graphsdirected proper connection number

Mathematics Subject Classification ID

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

Recommendations

• Proper connection number of random graphs
• A note on thresholds and connectivity in random directed graphs
• On the connectedness of a random graph
• COUNTABLY APPROXIMATING FRAMES
• Connectedness of certain random graphs
• Connectivity of finite anisotropic random graphs and directed graphs
• scientific article; zbMATH DE number 2089976
• \(k\)-connectivity in random graphs
• On the strength of connectedness of a random graph
• k-connectivity in random undirected graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 4049453 (Why is no real title available?)
• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• scientific article; zbMATH DE number 3375520 (Why is no real title available?)
• Characterizations of graphs having large proper connection numbers
• Directed proper connection of graphs
• General percolation and random graphs
• Hamiltonian circuits determining the order of chromosomes
• On proper-path colorings in graphs
• On the (di)graphs with (directed) proper connection number two
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• On the strength of connectedness of a random graph
• Paths in graphs
• Proper connection number of random graphs
• Proper connection of graphs
• Properly colored connectivity of graphs
• Rainbow vertex connection of digraphs
• Random Graphs
• The Strength of Connectivity of a Random Graph
• The transitive closure of a random digraph
• Total rainbow connection of digraphs

Cited in

(6)

• (Strong) proper vertex connection of some digraphs
• Proper-walk connection of Hamiltonian digraphs
• Proper connection and proper-walk connection of digraphs
• Some results on (strong) total proper connection number of some digraphs
• Digraphs with proper connection number two
• Directed proper connection number and almost spanning subgraphs.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279590)