<｜begin▁of▁sentence｜>### Instruction:
Using the graspologic library, how would one generate a simple Erdos Renyi graph with 6 vertices and an edge probability of 0.3, ensuring that the resulting graph does not have self-loops or directed edges?
### Response:
import numpy as np
from graspologic.simulations import er_np

# Set random seed for reproducibility
np.random.seed(42)

# Number of vertices
n = 6

# Probability of an edge existing between two vertices
p = 0.3

# Generate a binary Erdos Renyi (n, p) graph
A = er_np(n, p)

# Print the adjacency matrix
print('Erdos Renyi (n, p) binary graph adjacency matrix:\n', A)
<|EOT|>
