Combinatorial properties of Farey graphs
From MaRDI portal
domination numbermatching numberindependence numbermaximum matchingcombinatorial problemminimum dominating setFarey graphmaximum independence set
Social networks; opinion dynamics (91D30) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30)
Recommendations
- Combinatorics of \(k\)-Farey graphs
- Enumerative properties of Ferrers graphs
- The Feller property for graphs
- Combinatorial properties of dependence graphs
- Fubini numbers and polynomials of graphs
- Factorial properties of graphs
- Combinatorial properties of products of graphs
- scientific article; zbMATH DE number 691512
- On the Fibonacci numbers of the composition of graphs
- Combinatorial Relations and Chromatic Graphs
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- Acyclic orientations of graphs
- Algorithms for maximum independent sets
- Automorphisms of the pants complex
- Collective dynamics of `small-world' networks
- Deterministic small-world networks
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- Farey Series and Maximal Outerplanar Graphs
- Farey graphs as models for complex networks
- Geometry of pseudocharacters.
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Inapproximability of dominating set on power law graphs
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Matching theory
- Maximum matching in regular and almost regular graphs
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Models of the small world.
- Network science. With Márton Pósfai
- On Dominating Sets and Independent Sets of Graphs
- On Farey table and its compression for space optimization with guaranteed error bounds
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- On the number of minimal dominating sets on some graph classes
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Renormalization group analysis of the small-world network model
- Simplicial embeddings between pants graphs
- The Complexity of Enumeration and Reliability Problems
- The Haros-Farey sequence at two hundred years. A survey
- The Structure and Function of Complex Networks
- The asymptotic dimension of a curve graph is finite
- The complexity of computing the permanent
- The normalized Laplacian spectrum of subdivisions of a graph
- The small-world phenomenon: an algorithmic perspective
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
Cited in
(9)- Farey graphs as models for complex networks
- Ubiquity and the Farey graph
- Modeling spatial networks by contact graphs of disk packings
- Farey-subgraphs and continued fractions
- Farey lines defining Farey diagrams and application to some discrete structures
- The Farey graph
- Combinatorics of \(k\)-Farey graphs
- Rainbow vertex-connection number on a small-world Farey graph
- The Tutte polynomial of a class of compound graphs and its applications
This page was built for publication: Combinatorial properties of Farey graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333787)
