Results 71 to 80 of about 502 (87)

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

On the distinguishing chromatic number of the Kronecker products of graphs

AKCE International Journal of Graphs and Combinatorics
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, Kazem Khashyarmanesh, Mojgan Afkhami   +2 more
doaj   +1 more source

GENERALIZATION ON PRODUCT DEGREE DISTANCE OF TENSOR PRODUCT OF GRAPHS

, 2016
K. Pattabiraman
semanticscholar   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Domination defect for the join and corona of graphs

Applied Mathematical Sciences, 2021
The domination number of a graph G denoted by γ(G) is the minimum number of vertices required to dominate all the vertices of G. The minimality of γ(G) implies that if W ⊆ V (G) such that |W | < γ(G), then there is at least one vertex of G that is not ...
Aldwin T. Rolito G. Eballe, R. G. Eballe
semanticscholar   +1 more source

Triangular index of some graph products

Applied Mathematical Sciences, 2021
The number of triangles in a graph G is called the triangular index of G, denoted by Ti(G). In this paper we give the exact expressions for the triangular indices of the complete product G ∨ H, corona product G ◦ H, cartesian product G H, and tensor ...
Remarl Joseph M. Damalerio, R. G. Eballe
semanticscholar   +1 more source

Exploring the vertex and edge corona of graphs for their weakly connected 2-domination

International Journal of Contemporary Mathematical Sciences, 2021
A weakly connected 2-dominating set of a connected graph G is a set D ⊆ V (G) such that every vertex in V (G)\D is adjacent to at least two vertices in D and the subgraph 〈D〉w, which is the one weakly induced by D, is connected. In this paper, the weakly
Mae P. Militante, R. G. Eballe
semanticscholar   +1 more source