# UndirectedGraphQ

yields True if the graph g is an undirected graph and False otherwise.

# Details

• A graph is undirected if every edge in the graph is undirected.

# Examples

open allclose all

## Basic Examples(2)

Test whether a graph is undirected:

UndirectedGraphQ gives False for inputs that are not undirected graphs:

## Scope(6)

UndirectedGraphQ works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

UndirectedGraphQ gives False for anything that is not an undirected graph:

UndirectedGraphQ works with large graphs:

## Properties & Relations(5)

The empty graphs are undirected graphs:

An undirected graph can have self-loops:

A graph is either undirected or directed:

A symmetric adjacency matrix is interpreted to be an undirected graph:

Use to interpret it as a directed graph:

The incidence matrix of an undirected graph has no negative entries:

## Possible Issues(1)

UndirectedGraphQ gives False for non-explicit graphs:

Wolfram Research (2010), UndirectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/UndirectedGraphQ.html.

#### Text

Wolfram Research (2010), UndirectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/UndirectedGraphQ.html.

#### CMS

Wolfram Language. 2010. "UndirectedGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/UndirectedGraphQ.html.

#### APA

Wolfram Language. (2010). UndirectedGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/UndirectedGraphQ.html

#### BibTeX

@misc{reference.wolfram_2023_undirectedgraphq, author="Wolfram Research", title="{UndirectedGraphQ}", year="2010", howpublished="\url{https://reference.wolfram.com/language/ref/UndirectedGraphQ.html}", note=[Accessed: 28-September-2023 ]}

#### BibLaTeX

@online{reference.wolfram_2023_undirectedgraphq, organization={Wolfram Research}, title={UndirectedGraphQ}, year={2010}, url={https://reference.wolfram.com/language/ref/UndirectedGraphQ.html}, note=[Accessed: 28-September-2023 ]}