Results 61 to 70 of about 102 (86)

One-Three Join: A Graph Operation and Its Consequences

Discussiones Mathematicae Graph Theory, 2017
In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
doaj   +1 more source

On Accurate Domination in Graphs

Discussiones Mathematicae Graph Theory, 2019
A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of
Cyman Joanna, Henning Michael A., Topp Jerzy   +2 more
doaj   +1 more source

On Two Generalized Connectivities of Graphs

Discussiones Mathematicae Graph Theory, 2018
The concept of generalized k-connectivity κk(G), mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity.
Sun Yuefang, Li Fengwei, Jin Zemin
doaj   +1 more source

Computing the Metric Dimension of a Graph from Primary Subgraphs

Discussiones Mathematicae Graph Theory, 2017
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, Rodríguez-Velázquez Juan A., Yero Ismael G.   +2 more
doaj   +1 more source

The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings

Discussiones Mathematicae - General Algebra and Applications, 2019
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

Annales Mathematicae Silesianae
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]

Adv Differ Equ, 2020
Darlai R, Moore EJ, Koonprasert S.
europepmc   +1 more source

The local vertex anti-magic coloring for certain graph operations. [PDF]

Heliyon
Uma L, Rajasekaran G.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Reformulated Zagreb indices of vertex F-join graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2020
K Pattabiraman
exaly  

On some parameters related to matching of graph powers

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Saeid Alikhani
exaly