Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
PeterBurbery`Combinatorics`
ReflexiveGraphQ  |
| | |||||
Details and Options
Examples
(2)
Basic Examples
(2)
Tuples form a reflexive graph:
In[1]:=
Tuples[CharacterRange["a","e"],2]
Out[1]=
{{a,a},{a,b},{a,c},{a,d},{a,e},{b,a},{b,b},{b,c},{b,d},{b,e},{c,a},{c,b},{c,c},{c,d},{c,e},{d,a},{d,b},{d,c},{d,d},{d,e},{e,a},{e,b},{e,c},{e,d},{e,e}}
In[2]:=
g=Graph[UndirectedEdge@@@%]
Out[2]=
In[3]:=
 | ReflexiveGraphQ |
Out[3]=
True
After deleting one of its self-loops, the graph is no longer reflexive:
In[4]:=
EdgeDelete[g,UndirectedEdge["d","d"]]
Out[4]=
In[5]:=
| ReflexiveGraphQ |
Out[5]=
False
The divisibility relation between integers is reflexive since each integer divides itself:
In[1]:=
g=RelationGraph[(Mod[#1,#2]0)&,Range[6],VertexLabels"Name"]
Out[1]=
In[2]:=
| ReflexiveGraphQ |
Out[2]=
True
 |
|
 |
|
|
""