Results 211 to 220 of about 3,952,319 (243)

Italian Domination in Rooted Product Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2021
© 2020, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. In this article, we obtain closed formulae for the Italian domination number of rooted product graphs.
Juan Alberto Rodriguez-Velazquez, LuisPedro Montejano   +1 more
exaly   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Rooted Product and Restricted Rooted Product of Soft Directed Graphs

New Mathematics and Natural Computation, 2023
Molodtsov proposed soft set theory as a mathematical framework for handling uncertain data. Nowadays, a lot of people employ soft set theory to solve decision making problems. A graph with directed edges is known as a directed graph. Studying and resolving issues with social networks, shortest paths, electrical circuits, etc.
Jinta Jose, Bobin George, Rajesh K. Thumbakara   +2 more
openaire   +2 more sources

The Independence Polynomial of Rooted Products of Graphs

Discrete Applied Mathematics, 2010
A stable (or independent) set in a graph is a set of pairwise nonadjacent vertices thereof. The stability number \(\alpha(G)\) is the maximum size of stable sets in a graph \(G\). The independence polynomial of \(G\) is \[ I(G;x) = \sum_{k=0}^{\alpha(G)} s_kx^k= s_0+s_1x+s_2x^2+\cdots+ s_{\alpha(G)} x^{\alpha(G)} \quad (s_0:=1), \] where \(s_k\) is the
exaly   +2 more sources

Partition Dimension of Rooted Product Graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohan Chris Monica, Samivel Santhakumar
exaly   +4 more sources

On Real-rootedness of Independence Polynomials of Rooted Products of Graphs

Acta Mathematicae Applicatae Sinica, English Series, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Aria Ming-yue, Zhu, Bao-xuan
openaire   +2 more sources

Spectra of M-rooted product of graphs

Linear and Multilinear Algebra, 2020
In this paper, we define a new graph operation, namely, M-rooted product of graphs which generalizes the existing rooted product of graphs.
R. Rajkumar, R. Pavithra
openaire   +1 more source

Close-to-zero eigenvalues of the rooted product of graphs

Journal of Mathematical Chemistry, 2021
In the quantum chemistry the energy gap refers to the energy of an electron in the HOMO-LUMO transfer. The energy gap is the difference between the smallest positive \(\lambda_+\) and the largest negative eigenvalue \(\lambda_-\) of the adjacency matrix of the associated molecular graph. In this paper the authors use a rooted product of two graphs \(G\)
Vladimir R. Rosenfeld, Yujun Yang
openaire   +2 more sources

The signless Laplacian spectrum of rooted product of graphs

Discrete Mathematics, Algorithms and Applications, 2018
Let [Formula: see text] be a simple graph with [Formula: see text] vertices and [Formula: see text] be a sequence of [Formula: see text] rooted graphs [Formula: see text]. The rooted product [Formula: see text], of [Formula: see text] by [Formula: see text] is constructed by identifying the root vertex of [Formula: see text] with the [Formula: see ...
Maryam Maghsoudi, Abbas Heydari
openaire   +3 more sources

Corona products and rooted products of soft graphs

Discrete Mathematics, Algorithms and Applications
Soft set theory is a broad mathematical method for handling uncertain data. Numerous scholars are now using soft set theory to address problems related to decision-making. The concept of soft graphs provides a parameterized point of view for graphs. In graph theory, graph products are binary operations on graphs with various combinatorial purposes. We
Jinta Jose, Bobin George, Rajesh K. Thumbakara   +2 more
openaire   +1 more source

On the {2}-Domination Number of Rooted Product Graphs

Quaestiones Mathematicae
Abel Cabrera Martinez
exaly   +2 more sources