Results 61 to 70 of about 99 (84)

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

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

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

The security number of lexicographic products

Quaestiones Mathematicae, 2018
A subset S of vertices of a graph G is a secure set if |N[X] ∩ S| ≥ |N[X]−S| holds for any subset X of S, where N[X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G.
Iztok Peterin, Marko Jakovac, Tanja Dravec   +2 more
exaly   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the bounded partition dimension of some classes of convex polytopes

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Muhammad Azeem, Muhammad Faisal Nadeem, Ali Ahmad   +2 more
exaly  

Further results on the independent Roman domination number of graphs

Quaestiones Mathematicae, 2023
Abel Cabrera Martinez
exaly  

Double outer-independent domination number of graphs

Quaestiones Mathematicae, 2021
Abel Cabrera Martinez
exaly  

An improved result on Laplacian spectral ratio of connected graphs

Journal of Information and Optimization Sciences, 2021
Zhen Lin
exaly