MultigraphQ

✖
`MultigraphQ`

✖

MultigraphQ[g]

yields True if the graph g is a multigraph and False otherwise.

Details

A graph is a multigraph if there are multiple undirected edges or multiple directed edges with the same direction between the same vertices.

Examples

open allclose all

Basic Examples (2)Summary of the most common use cases

Test whether a graph has multiple edges:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-edhy8a

Out[1]=1

In[2]:=2

✖

https://wolfram.com/xid/0mk5icq5hdtv-f9w1u8

Out[2]=2

MultigraphQ gives False for inputs that are not graphs with multiple edges:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-blilb2

Out[1]=1

In[2]:=2

✖

https://wolfram.com/xid/0mk5icq5hdtv-i269gu

Out[2]=2

Scope (2)Survey of the scope of standard use cases

MultigraphQ gives False for expressions that are not graphs:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-s7turc

Out[1]=1

MultigraphQ works with large graphs:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-pq9ae

In[2]:=2

✖

https://wolfram.com/xid/0mk5icq5hdtv-brp63o

In[3]:=3

✖

https://wolfram.com/xid/0mk5icq5hdtv-cevvx1

Out[3]=3

Properties & Relations (2)Properties of the function, and connections to other functions

A PathGraph has no multiple edges:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-ekh65

Out[1]=1

In[2]:=2

✖

https://wolfram.com/xid/0mk5icq5hdtv-dsjtnn

Out[2]=2

The adjacency matrix of a graph with multiple edges has some entries greater than 1:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-bsehov

Out[1]=1

In[2]:=2

✖

https://wolfram.com/xid/0mk5icq5hdtv-gt1gl3

Out[2]=2

In[3]:=3

✖

https://wolfram.com/xid/0mk5icq5hdtv-dj0bt4

Out[3]=3

Its incidence matrix has repeated columns:

In[4]:=4

✖

https://wolfram.com/xid/0mk5icq5hdtv-rd3ld

Out[4]=4

Possible Issues (1)Common pitfalls and unexpected behavior

MultigraphQ gives False for non-explicit graphs:

In[1]:=1

✖

https://wolfram.com/xid/0mk5icq5hdtv-iu6w07

Out[1]=1

Top