Equidistant dimension of Cartesian product graphs
Given a connected graph $G$, the equidistant dimension of $G$ represents the cardinality of the smallest set of vertices $S$ of $G$ such that for any two vertices $x,y\notin S$ there is at least one vertex in $S$ equidistant to both $x,y$ in terms of distances.
Gispert-Fernandez, Adria +2 more
openaire +2 more sources
Projective Planar Cartesian Products of Graphs
In this paper, we provide a complete classification of Cartesian products of graphs that embed in the projective plane. Our work requires us to determine minimal Cartesian products that are nonprojective planar, organize their essential properties to be used as constraints for projective planar embeddings, and explicitly construct projective planar ...
Abell, Nicholas +2 more
openaire +2 more sources
A lightweight cryptographic algorithm incorporating path coloring of cartesian product of graphs. [PDF]
Shivapriya P, Meera KN, Lin Y.
europepmc +1 more source
Graph-Based Internal Coordinate Analysis for Transition State Characterization. [PDF]
Goodfellow AS, Nguyen BN.
europepmc +1 more source
Multi-Dimensional Quantum-like Resources from Complex Synchronized Networks. [PDF]
Saha D, Scholes GD.
europepmc +1 more source
Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc +1 more source
Accelerated north-east shift of the global green wave trajectory. [PDF]
Mahecha MD +17 more
europepmc +1 more source
Fuzzy incidence coloring under structural operations for communication channel allocation. [PDF]
Deji A, Wang Q, Zhou L.
europepmc +1 more source
Eye Movement Analysis: A Kernel Density Estimation Approach for Saccade Direction and Amplitude. [PDF]
Fehlinger P, Ertl B, Watzka B.
europepmc +1 more source
Status connectivity indices of cartesian product of graphs
In this paper, we establish one of the recent topological indices called the first status connectivity index S1(G) = Puv?E(G)[?G(u) + ?G(v)] and second status connectivity index S2(G) = Puv?E(G)[?G(u)?G(v)] of Cartesian product of two simple graphs are determined.
openaire +2 more sources

