Results 1 to 10 of about 5,938 (166)
The partition dimension of the vertex amalgamation of some cycles
Heliyon, 2022 Let G=(V(G),E(G)) be a connected, finite, simple, and undirected graph. The distance between two vertices u,w∈V(G), denoted by d(u,w), is the shortest length of (u,w)-path in G.
Amir Kamal Amir
exaly +3 more sources
A social network graph partitioning algorithm based on double deep Q-Network [PDF]
Scientific ReportsWith the rapid expansion of social networks, efficiently mining and analyzing massive graph data has become a fundamental challenge in social network research. Graph partitioning plays a pivotal role in enhancing the performance of such analyses. However,
Jie Cao +4 more
doaj +2 more sources
Factorization of rational six vertex model partition functions
Nuclear Physics BWe show factorization formulas for a class of partition functions of rational six vertex model. First we show factorization formulas for partition functions under triangular boundary.
Kohei Motegi
exaly +3 more sources
Topological structures induced by chromatic partitioning of vertex set of graphic [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 This paper presents a method of constructing topologies on vertex set of a graph G induced by chromatic partition of vertex set of the graph. It introduces colour lower approximation and colour upper approximation of vertex induced subgraphs and ...
K. Lalithambigai, P. Gnanachandra
doaj +1 more source
Opuscula Mathematica, 2023 A coalition in a graph \(G = (V, E)\) consists of two disjoint sets \(V_1\) and \(V_2\) of vertices, such that neither \(V_1\) nor \(V_2\) is a dominating set, but the union \(V_1 \cup V_2\) is a dominating set of \(G\). A coalition partition in a graph \
Teresa W. Haynes +4 more
doaj +1 more source
Nullspace vertex partition in graphs [PDF]
Journal of Combinatorial Optimization, 2020 17 pages 6 ...
Irene Sciriha +2 more
openaire +3 more sources
Ordered Vertex Partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modular decomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems.
Ross M. McConnell, Jeremy P. Spinrad
openaire +5 more sources
More on topological vertex formalism for 5-brane webs with O5-plane
Journal of High Energy Physics, 2021 We propose a concrete form of a vertex function, which we call O-vertex, for the intersection between an O5-plane and a 5-brane in the topological vertex formalism, as an extension of the work of [1].
Hirotaka Hayashi, Rui-Dong Zhu
doaj +1 more source
On the Bounded Partition Dimension of Some Generalised Graph Structures
Journal of Mathematics, 2022 Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ..
Wajdi Alghamdi, Muhammad Ahsan Asim
doaj +1 more source
Computing the partition dimension of certain families of Toeplitz graph
Frontiers in Computational Neuroscience, 2022 Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path ...
Ricai Luo +5 more
doaj +1 more source