monopartite graph
A graph in which every node is the same kind of thing, so relationships connect like to like.
Also written: monopartite graphs, monopartite, unipartite graph, unipartite graphs, unipartite
Learn more in Projecting monopartite graphs
Example
Every node here is a (:Person). Each [:KNOWS] relationship joins one person to another.
Adding a single (:Company) node and [:WORKS_AT] relationship would turn this into a heterogeneous graph. It would not become bipartite because nodes of the same label would still connect to each other.
Lessons that use this term
The lesson and course links below open in a new tab.
18 lessons use this term. Results are ordered by term density.
Get started with Graph Data Science53 mentions
- Projecting monopartite graphsGDS basic conceptsWhat monopartite graphs are and how they differ from bipartite graphs The difference between graph structure and graph labels Why GDS13 mentions
- Practice monopartite projectionsGDS basic conceptsgraph structure and graph labels, it's time to practice creating true monopartite14 mentions
- Challenge: Monopartite projectionGDS basic conceptslearned how to create various monopartite3 mentions
- Projection modeling for algorithmsEssential projection techniquesModule 2, you discovered that the same data can be projected in different ways—monopartite, bipartite, or4 mentions
- Module recap and what's nextGDS basic conceptsMonopartite - Same node type (actors ↔ actors) Bipartite - Different node types preserved (users ↔ movies) -2 mentions
- Practice relationship aggregationEssential projection techniquescreate a monopartite actor network where the weight represents how many movies two actors worked on2 mentions
- Challenge: Projection modeling and analysisEssential projection techniquesShould this be monopartite (Director -> Director) or bipartite (Director ->3 mentions
- Practice bipartite projectionsGDS basic conceptsLesson 4, you created monopartite projections by transforming bipartite4 mentions
- List and drop graphsGDS basic conceptsthat you've practiced creating various types of projections—monopartite, bipartite, and multipartite—it's time to learn how to manage them2 mentions
- Projecting bipartite and multipartite graphsGDS basic conceptsMonopartite: nodes cannot be separated into distinct non-overlapping sets Bipartite: exactly two non-overlapping sets,2 mentions
- Project a graphGDS basic conceptsalgorithms work optimally on monopartite graphs (single node type), while others are designed for bipartite graphs (two distinct node1 mention
- Module recapEssential projection techniquesor "Which directors work in the same circles?" Choose node types: Monopartite (Actor -> Actor) or Bipartite (User -> Movie) Determine relationships: Direct, inferred, weighted, or1 mention
- Algorithms overviewWorking with algorithmsyou already ran several GDS algorithms: degree centrality and PageRank on monopartite graphs, and node similarity on bipartite1 mention
- Understand the five execution modesWorking with algorithmsIn the monopartite lessons, you used stream mode: gds.degree.stream() and gds.pageRank.stream() to view results directly in query1 mention
Graph Data Science in Practice15 mentions
- Projection PracticeGDS FoundationsMonopartite transformations — connecting nodes through shared neighbours Labelled bipartite projections — preserving6 mentions
- Graph Projections and StructureGDS FoundationsDistinguish between graph structure and node labels in GDS Identify monopartite, bipartite, multipartite, and heterogeneous graph structures Choose appropriate projection strategies based on your8 mentions
- Fraud DetectionCommunity Detection for FraudApproach | What It Captures | What It Loses | | --- | --- | --- | | Monopartite (UserP2P → UserP2P) | Direct transactions | Shared infrastructure | | Bipartite (UserP2P → Card/Device) | Shared1 mention
Analyze Graph Data with Python1 mention
- From Cypher to Native ProjectionGDS Python Clientthe Cypher-based methods when you need pattern transformations like monopartite1 mention