The Canonical Join Complex [PDF]
Electronic Journal of Combinatorics, 2016 A canonical join representation is a certain minimal "factorization" of an element in a finite lattice $L$ analogous to the prime factorization of an integer from number theory. The expression $\bigvee A =w$ is the canonical join representation of $w$ if
Emily Barnard
semanticscholar +1 more source
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
, 2023 Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory.
Michal Staš, Jana Fortes
core +1 more source
A systematic approach to constructing incremental topology control algorithms using graph transformation [PDF]
Journal of Visual Languages and Computing, 2017 Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required ...
R. Kluge +5 more
semanticscholar +1 more source
Competition between Social Groups, In-group Favoritism and Population-level Cooperation
Cliodynamics, 2018 Humans are social beings; people are predisposed to join groups, categorize the social world into groups, and prefer fellow in-group members over out-group members.
Janos Zoltan Varga
doaj +1 more source
Is Network Structure Important for Protest Mobilization? Findings from Agent-Based Modeling
Мониторинг общественного мнения: экономические и социальные перемены, 2021 In recent decades, the focus of civic engagement research has shifted towards studying social environments’ effects on individuals’ decisions on whether to participate in a given activity or not. Online communication has been increasingly influencing the
Александр Пхоун Чжо Петров +3 more
doaj +1 more source
JET: Dynamic Join-Exit-Tree Amortization and Scheduling for Contributory Key Management
IEEE/ACM Transactions on Networking, 2006 K J Ray Liu
exaly +2 more sources
Topological self-joinings of Cartan actions by toral automorphisms [PDF]
Duke Mathematical Journal, 2012 40 ...
Elon Lindenstrauss, Zhiren Wang
openaire +4 more sources
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
, 2021 The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
core +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
The Reformulated F-Index of Vertex and Edge F-Join of Graphs
Journal of Chemistry, 2022 The valency based topological indices (TIs) are defined by algebraic functions as the chemical graph theory tools in which the structural parameters are used as input and the output is related with the topology of chemical species.
Durbar Maji +2 more
doaj +1 more source