WOLFRAM

Wolfram Language & System Documentation Center

EdgeTaggedGraphQ[g]

yields True if the graph g has edges tagged and False otherwise.

Details
Details and Options Details and Options
Examples  
Basic Examples  
Scope  
Properties & Relations  
See Also
Related Guides
History
Cite this Page

EdgeTaggedGraphQ

EdgeTaggedGraphQ[g]

yields True if the graph g has edges tagged and False otherwise.

Details

  • EdgeTaggedGraphQ is typically used to test whether a graph has an edge with a tag.

Examples

open all close all

Basic Examples  (2)

Test whether a graph is tagged:

Wolfram Language code: EdgeTaggedGraph[{12, 23, 31}]
Wolfram Language code: EdgeTaggedGraphQ[%]

EdgeTaggedGraphQ gives False for inputs that are not tagged graphs:

Wolfram Language code: CompleteGraph[5]
Wolfram Language code: EdgeTaggedGraphQ[%]

Scope  (6)

EdgeTaggedGraphQ works with undirected graphs:

Wolfram Language code: EdgeTaggedGraphQ[[image]]

Directed graphs:

Wolfram Language code: EdgeTaggedGraphQ[[image]]

Multigraphs:

Wolfram Language code: EdgeTaggedGraphQ[[image]]

Mixed graphs:

Wolfram Language code: EdgeTaggedGraphQ[[image]]

EdgeTaggedGraphQ gives False for anything that is not a tagged graph:

Wolfram Language code: EdgeTaggedGraphQ[x]
Wolfram Language code: EdgeTaggedGraphQ[Graph[garbage]]

EdgeTaggedGraphQ works with large graphs:

Wolfram Language code: g = GridGraph[{10, 10, 10, 10}];
Wolfram Language code: EdgeTaggedGraphQ[%] // Timing
Wolfram Language code: {VertexCount[g], EdgeCount[g]}

Properties & Relations  (5)

IndexEdgeTaggedGraph generates tagged graphs:

Wolfram Language code: IndexEdgeTaggedGraph[WheelGraph[5]]
Wolfram Language code: EdgeTaggedGraphQ[%]

Use UndirectedEdge to construct undirected tagged graphs:

Wolfram Language code: Graph[{1Overscript[, 1]2, 2Overscript[, 1]3, 3Overscript[, 1]1}]
Wolfram Language code: {UndirectedGraphQ[%], EdgeTaggedGraphQ[%]}

Use DirectedEdge to construct directed tagged graphs:

Wolfram Language code: Graph[{1Overscript[, 1]2, 2Overscript[, 1]3, 3Overscript[, 1]1}]
Wolfram Language code: {DirectedGraphQ[%], EdgeTaggedGraphQ[%]}

A tagged graph can have self-loops:

Wolfram Language code: Graph[{12, 11, 23, 31}]
Wolfram Language code: {EdgeTaggedGraphQ[%], LoopFreeGraphQ[%]}

EdgeTags gives the list of tags of a graph:

Wolfram Language code: g = IndexEdgeTaggedGraph[CompleteGraph[4]]
Wolfram Language code: EdgeTaggedGraphQ[g]
Wolfram Language code: EdgeTags[g]
Wolfram Research (2020), EdgeTaggedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/EdgeTaggedGraphQ.html.

Text

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

CMS

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

APA

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

BibTeX

@misc{reference.wolfram_2026_edgetaggedgraphq, author="Wolfram Research", title="{EdgeTaggedGraphQ}", year="2020", howpublished="\url{https://reference.wolfram.com/language/ref/EdgeTaggedGraphQ.html}", note=[Accessed: 12-June-2026]}

BibLaTeX

@online{reference.wolfram_2026_edgetaggedgraphq, organization={Wolfram Research}, title={EdgeTaggedGraphQ}, year={2020}, url={https://reference.wolfram.com/language/ref/EdgeTaggedGraphQ.html}, note=[Accessed: 12-June-2026]}