Skip to main content
Ctrl+K
NetworkX 3.7.1rc0.dev0 documentation - Home NetworkX 3.7.1rc0.dev0 documentation - Home
  • Install
  • Tutorial
  • Backends
  • Reference
  • Gallery
  • Developer
  • Releases
  • Guides
  • Home Page
  • GitHub
  • Install
  • Tutorial
  • Backends
  • Reference
  • Gallery
  • Developer
  • Releases
  • Guides
  • Home Page
  • GitHub

Section Navigation

  • Introduction
  • Graph types
  • Algorithms
  • Functions
  • Graph generators
    • graph_atlas
    • graph_atlas_g
    • balanced_tree
    • barbell_graph
    • binomial_tree
    • complete_graph
    • complete_multipartite_graph
    • circular_ladder_graph
    • circulant_graph
    • cycle_graph
    • dorogovtsev_goltsev_mendes_graph
    • empty_graph
    • full_rary_tree
    • kneser_graph
    • ladder_graph
    • lollipop_graph
    • null_graph
    • path_graph
    • star_graph
    • tadpole_graph
    • trivial_graph
    • turan_graph
    • wheel_graph
    • margulis_gabber_galil_graph
    • chordal_cycle_graph
    • paley_graph
    • maybe_regular_expander
    • maybe_regular_expander_graph
    • is_regular_expander
    • random_regular_expander_graph
    • grid_2d_graph
    • grid_graph
    • hexagonal_lattice_graph
    • hypercube_graph
    • triangular_lattice_graph
    • LCF_graph
    • bull_graph
    • chvatal_graph
    • cubical_graph
    • desargues_graph
    • diamond_graph
    • dodecahedral_graph
    • frucht_graph
    • generalized_petersen_graph
    • heawood_graph
    • hoffman_singleton_graph
    • house_graph
    • house_x_graph
    • icosahedral_graph
    • krackhardt_kite_graph
    • moebius_kantor_graph
    • octahedral_graph
    • pappus_graph
    • petersen_graph
    • sedgewick_maze_graph
    • shrikhande_graph
    • tetrahedral_graph
    • truncated_cube_graph
    • truncated_tetrahedron_graph
    • tutte_graph
    • fast_gnp_random_graph
    • gnp_random_graph
    • dense_gnm_random_graph
    • gnm_random_graph
    • erdos_renyi_graph
    • binomial_graph
    • newman_watts_strogatz_graph
    • watts_strogatz_graph
    • connected_watts_strogatz_graph
    • random_regular_graph
    • barabasi_albert_graph
    • dual_barabasi_albert_graph
    • extended_barabasi_albert_graph
    • powerlaw_cluster_graph
    • random_kernel_graph
    • random_k_lift
    • random_lobster_graph
    • random_shell_graph
    • random_powerlaw_tree
    • random_powerlaw_tree_sequence
    • duplication_divergence_graph
    • partial_duplication_graph
    • configuration_model
    • directed_configuration_model
    • expected_degree_graph
    • havel_hakimi_graph
    • directed_havel_hakimi_graph
    • degree_sequence_tree
    • random_degree_sequence_graph
    • random_clustered_graph
    • gn_graph
    • gnr_graph
    • gnc_graph
    • random_k_out_graph
    • scale_free_graph
    • geometric_edges
    • geographical_threshold_graph
    • navigable_small_world_graph
    • random_geometric_graph
    • soft_random_geometric_graph
    • thresholded_random_geometric_graph
    • waxman_graph
    • geometric_soft_configuration_graph
    • line_graph
    • inverse_line_graph
    • ego_graph
    • stochastic_graph
    • random_internet_as_graph
    • uniform_random_intersection_graph
    • k_random_intersection_graph
    • general_random_intersection_graph
    • karate_club_graph
    • davis_southern_women_graph
    • florentine_families_graph
    • les_miserables_graph
    • caveman_graph
    • connected_caveman_graph
    • gaussian_random_partition_graph
    • LFR_benchmark_graph
    • planted_partition_graph
    • random_partition_graph
    • relaxed_caveman_graph
    • ring_of_cliques
    • stochastic_block_model
    • windmill_graph
    • spectral_graph_forge
    • prefix_tree
    • random_labeled_tree
    • random_labeled_rooted_tree
    • random_labeled_rooted_forest
    • random_unlabeled_tree
    • random_unlabeled_rooted_tree
    • random_unlabeled_rooted_forest
    • nonisomorphic_trees
    • number_of_nonisomorphic_trees
    • triad_graph
    • is_valid_joint_degree
    • joint_degree_graph
    • is_valid_directed_joint_degree
    • directed_joint_degree_graph
    • mycielskian
    • mycielski_graph
    • hnm_harary_graph
    • hkn_harary_graph
    • random_cograph
    • interval_graph
    • sudoku_graph
    • visibility_graph
  • Linear algebra
  • Converting to and from other data formats
  • Relabeling nodes
  • Reading and writing graphs
  • Drawing
  • Randomness
  • Exceptions
  • Utilities
  • Backends
  • Configs
  • Glossary
  • Reference
  • Graph generators
  • maybe_regular_expander

maybe_regular_expander#

maybe_regular_expander(n, d, *, create_using=None, max_tries=100, seed=None)[source]#

Deprecated since version 3.6: maybe_regular_expander is a deprecated alias for maybe_regular_expander_graph. Use maybe_regular_expander_graph instead.

On this page
  • maybe_regular_expander()

© Copyright 2004-2026, NetworkX Developers.

Created using Sphinx 9.1.1.

Built with the PyData Sphinx Theme 0.24.0.