Rainbow vertex-connection number on a small-world Farey graph

DOI10.1080/09728600.2022.2057827zbMath1487.05248OpenAlexW4224250280MaRDI QIDQ5074887

Wipawee Tangjai, Chayapa Darayon

Publication date: 10 May 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2022.2057827

zbMATH Keywords

outerplanar graphrainbow coloringrainbow vertex-connection numbersmall-world graphrainbow vertex-connectedsmall-world Farey graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Rainbow connection number of amalgamation of some graphs
• Total rainbow \(k\)-connection in graphs
• Algorithm on rainbow connection for maximal outerplanar graphs
• Farey graphs as models for complex networks
• Rainbow \(H\)-factors
• Rainbow vertex-connection and forbidden subgraphs
• Rainbow connections of graphs: a survey
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs
• Farey Series and Maximal Outerplanar Graphs
• Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Rainbow vertex-connection number on a small-world Farey graph