Results 71 to 80 of about 5,409,269 (206)
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete [PDF]
Hoffmann Stefan, Wanke, Egon
openalex +1 more source
Signed Complete Graphs with Maximum Index
Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source
A complete graph-based approach with multi-task learning for predicting synergistic drug combinations. [PDF]
Wang X +5 more
europepmc +1 more source
Consensus-Related Performance of Triplex MASs Based on Partial Complete Graph Structure. [PDF]
Bian J, Huang D, Xu J, Yu Z.
europepmc +1 more source
Some Properties of the Nil-Graphs of Ideals of Commutative Rings
Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices
Reza Nikandish
doaj
Landauer Principle and Einstein Synchronization of Clocks: Ramsey Approach
We introduce a synchronization procedure for clocks based on the Einstein–Landauer framework. Clocks are modeled as discrete, macroscopic devices operating at a thermal equilibrium temperature T.
Edward Bormashenko, Michael Nosonovsky
doaj +1 more source
A note on the metric dimension of subdivided thorn graphs
For some ordered subset W = {w1, w2, ⋯, wt} of vertices in connected graph G, and for some vertex v in G, the metric representation of v with respect to W is defined as the t-vector r(v∣W) = {d(v, w1), d(v, w2), ⋯, d(v, wt)}.
Lyra Yulianti +2 more
doaj +1 more source
DIMENSI METRIK KETETANGGAAN LOKAL GRAF HASIL OPERASI k-COMB
Research on the local adjacency metric dimension has not been found in all operations of the graph, one of them is comb product graph. The purpose of this research was to determine the local adjacency metric dimension of k-comb product graph and level ...
Fryda Arum Pratama +2 more
doaj +1 more source
Choosability with Separation in Complete Multipartite Graphs [PDF]
Puleo, Gregory J.
openalex +1 more source
Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search
Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently.
Renato Portugal, Jalil Khatibi Moqadam
doaj +1 more source

