Results 51 to 56 of about 67 (56)
Computing the Metric Dimension of a Graph from Primary Subgraphs
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . .
Kuziak Dorota +2 more
doaj +1 more source
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +1 more source
The Subset-Strong Product of Graphs
In this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs ...
Eliasi Mehdi
doaj +1 more source
Andronov-Hopf and Neimark-Sacker bifurcations in time-delay differential equations and difference equations with applications to models for diseases and animal populations. [PDF]
Darlai R, Moore EJ, Koonprasert S.
europepmc +1 more source
On the distinguishing chromatic number of the Kronecker products of graphs
In this paper, we investigate the distinguishing chromatic number of Kronecker product of paths, cycles, star graphs, symmetric trees, almost symmetric trees, and bisymmetric trees.
Zinat Rastgar +2 more
doaj +1 more source
The local vertex anti-magic coloring for certain graph operations. [PDF]
Uma L, Rajasekaran G.
europepmc +1 more source

