Results 201 to 210 of about 4,628 (221)

Unimodality of independence polynomials of rooted products of graphs

Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 2019
Abstract In 1987, Alavi, Malde, Schwenk and Erdős conjectured that the independence polynomial of any tree is unimodal. Although it attracts many researchers' attention, it is still open. Motivated by this conjecture, in this paper, we prove that rooted products of some graphs preserve real rootedness of independence polynomials.
Zhu, Bao-Xuan, Wang, Qingxiu
openaire   +1 more source

Semitotal domination in rooted product graphs

Asian-European Journal of Mathematics
A semitotal dominating set of a nontrivial connected graph G is a dominating set D of G such that every vertex in D is within distance two of another vertex in D. The semitotal domination number of G is the minimum cardinality among all semitotal dominating sets of G.
Abel Cabrera-Martinez, Jose Luis Lopez-Carmona, Jose M. Rodriguez, Alejandro Serrano-Diaz   +3 more
openaire   +1 more source

Dominant metric dimension of rooted product graph

Journal of Discrete Mathematical Sciences & Cryptography
Poverty is closely related to the problem of unequal distribution of basic needs across regions. To address this challenge, graph theory provides a rigorous framework for designing efficient distribution networks that ensure accessibility while minimizing cost.
Tyas Widya Damayanti, Liliek Susilowati, Nenik Estuningsih, Kamal Dliou   +3 more
openaire   +1 more source

The {2}-domination in rooted product graphs

Journal of Combinatorial Mathematics and Combinatorial Computing
<p>A <span class="math inline">\(\{2\}\)</span>-dominating function (<span class="math inline">\(\{2 \}\)</span>DF) on a graph <span class="math inline">\(G=(V(G),E(G))\)</span> is a function <span class="math inline">\(f : V(G) \rightarrow \{0,1,2 \}\)</span> such that <span class="math inline ...
openaire   +1 more source

Graph product techniques for cordial labeling on cubic root graph structures

Journal of Information & Optimization Sciences
Graph labeling is the term used to describe the procedure of giving unique identifiers. Graph attributing is a method for modeling real-world problems in industries such as circuit design, surveillance technology, and telecommunications networks. A graph is characterized as possessing cubic roots cordial labeling if each node is designated with either ...
J. Senbagamalar, D. Ramani Bai
openaire   +1 more source

k-Rooted Product of Two Graphs

International Journal of Mathematics Trends and Technology, 2021
Rashmi S B, Indrani Pramod Kelkar
openaire   +1 more source

Generalized spectral characterization of rooted product graphs

Linear and Multilinear Algebra, 2022
Lihuan Mao, Wei Wang
openaire   +1 more source

Italian Domination in Rooted Product Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2021
Juan Alberto Rodriguez-Velazquez, LuisPedro Montejano   +1 more
exaly  

Spectra of M-Rooted Product of Graphs

Linear and Multilinear Algebra, 2022
Rajendran Rajkumar, Pavithra Ramachandran   +1 more
exaly  

Generalized Spectral Characterization of Rooted Product Graphs

Linear and Multilinear Algebra, 2023
Lihuan Mao
exaly