Results 61 to 70 of about 6,572,416 (223)
Graph theory methods: applications in brain networks
Dialogues in Clinical Neuroscience, 2018 Network neuroscience is a thriving and rapidly expanding field. Empirical data on brain networks, from molecular to behavioral scales, are ever increasing in size and complexity.
O. Sporns
semanticscholar +1 more source
Partitioning technique for a discrete quantum system
, 2011 We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one.
I. Hubač +5 more
core +1 more source
Azimuthal Anisotropy in High Energy Nuclear Collision - An Approach based on Complex Network Analysis [PDF]
, 2018 Recently, a complex network based method of Visibility Graph has been applied to confirm the scale-freeness and presence of fractal properties in the process of multiplicity fluctuation.
Bhaduri, Susmita, Ghosh, Dr. Dipak
core +3 more sources
On centrally symmetric graphs [PDF]
Mathematica Bohemica, 1996 If \(L\) is a finite graded lattice with \(n\) atoms such that its dual lattice \(L^\star\) is strong and if its covering graph is centrally symmetric, then \(L\) is isomorphic to \(2^n\). This result is proved using a similar result of B. Zelinka which holds for a finite modular lattice with \(n\) atoms.
openaire +2 more sources
The Divisibility Graph of finite groups of Lie Type
, 2016 The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other.
Abdolghafourian, Adeleh +2 more
core +1 more source
Isolation Number of Transition Graphs
MathematicsLet G=(V,E) be a graph and F be a family of graphs; a subset (S⊆V(G)) is said to be an F-isolating set if G[V(G)∖NG[S]] does not contain F as a subgraph for all F∈F.
Junhao Qu, Shumin Zhang
doaj +1 more source
On diameters estimations of the commuting graphs of Sylow $p$-subgroups of the symmetric groups
Karpatsʹkì Matematičnì Publìkacìï, 2013 The commuting graph of a group $G$ is an undirected graph whose vertices are non-central elements of $G$ and two distinct vertices $x,y$ are adjacent if and only if $xy=yx$.
Yu.Yu. Leshchenko, L.V. Zoria
doaj +3 more sources
Clique Centrality and Global Clique Centrality of Graphs
Asian Research Journal of Mathematics, 2023 We formally introduce in this paper two parameters in graph theory, namely, clique centrality and global clique centrality. Let G be a finite, simple and undirected graph of order n. A clique in G is a nonempty subset W \(\subseteq\) V (G) such that the subgraph \(\langle\)W\(\rangle\)G induced by W is complete.
Rolito G. Eballe, Gerry J. Madriaga
openaire +1 more source
Goblin: A Framework for Enriching and Querying the Maven Central Dependency Graph
IEEE Working Conference on Mining Software RepositoriesDependency graphs support software maintenance and software ecosystem analysis. Several metrics can be used on top of these graph models but the set of such metrics is to evolve over time. Further, some metrics have a dynamic nature, requiring being able
Damien Jaime +2 more
semanticscholar +1 more source
A Restricted Black-Box Adversarial Framework Towards Attacking Graph Embedding Models [PDF]
AAAI Conference on Artificial Intelligence, 2019 With the great success of graph embedding model on both academic and industry area, the robustness of graph embedding against adversarial attack inevitably becomes a central problem in graph learning domain.
Heng Chang +7 more
semanticscholar +1 more source