graph motif

[[concept]]

motif

Let $F$ be a graph. $F$ is a motif if it is

• undirected
• unweighted
• with 1 edge per node pair
• not loopy (no self edges)

aliases:: motifs

---

Review

dsg

Q: What four characteristics do motif graphs have? -?- A: undirected, unweighted, one edge per node pair, not loopy

Mentions

Mentions

TABLE
FROM [[]]
 
FLATTEN choice(contains(artist, this.file.link), 1, "") + choice(contains(author, this.file.link), 1, "") + choice(contains(director, this.file.link), 1, "") + choice(contains(source, this.file.link), 1, "") as direct_source
 
WHERE !direct_source

const { dateTime } = await cJS()
 
return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}