Results 11 to 20 of about 5,537,193 (382)

Construction for trees without domination critical vertices

open access: yesAIMS Mathematics, 2021
Denote by γ(G) the domination number of graph G. A vertex v of a graph G is called fixed if v belongs to every minimum dominating set of G, and bad if v does not belong to any minimum dominating set of G. A vertex v of G is called critical if γ(G−v)
Ying Wang, Fan Wang, Weisheng Zhao
doaj   +1 more source

AUTOMATION OF QURANIC READINGS GATHERING PROCESS

open access: yesJournal of ICT, 2021
Quran has been the focus of many computer science and computational linguistics researchers. However, little contribution was directed towards Quranic readings. This field focuses on the different ways in which Quranic words can be recited.
Majed AbuSafiya
doaj   +1 more source

Trees with the second-minimal ABC energy

open access: yesAIMS Mathematics, 2022
The atom-bond connectivity energy (ABC energy) of an undirected graph $ G $, denoted by $ \mathcal{E}_{ABC}(G) $, is defined as the sum of the absolute values of the ABC eigenvalues of $ G $.
Xiaodi Song   +3 more
doaj   +1 more source

THE IMPACT OF AUTOMOBILE POLLUTED SOIL ON SEEDLING GROWTH PERFORMANCE IN SOME HIGHER PLANTS [PDF]

open access: yesJournal of Plant Development, 2022
Rapid increase in automobile density and discharge of different types of pollutants from automobile are a serious issue for whole civilized world and in Bhakkar also.Vehicle emission from automobiles released an enormous quantity of toxic pollutants ...
Muhammad KABIR   +5 more
doaj   +1 more source

Flexible Trees [PDF]

open access: yesProceedings of the International Working Conference on Advanced Visual Interfaces, 2016
We introduce Flexible Trees, a sketch-based layout adjustment technique. Although numerous tree layout algorithms exist, these algorithms are usually bound to fit within standard shapes such as rectangles, circles and triangles. In order to provide the possibility of interactively customizing a tree layout, we offer a free-form sketch-based interaction
Sadeghi, Javad   +4 more
openaire   +3 more sources

ANALYSIS OF EFFECTS OF LEAD AND IRON TREATMENT ON EARLY SEEDLING GROWTH OF ALBIZIA LEBBECK L. (BENTH.) AND EUCALYPTUS GLOBULUS LABILL. IN VITRO STUDIES [PDF]

open access: yesJournal of Plant Development, 2022
Pollution by heavy metals in the environment is a worldwide problem. The aim of the research study was to record the effect of lead (Pb) and iron (Fe) elements on early seedling growth of Albizia lebbeck L. (Benth.) and Eucalyptus globulus Labill.
Tabinda NOREEN   +4 more
doaj   +1 more source

Local multiset dimension of comb product of tree graphs

open access: yesAIMS Mathematics, 2023
Resolving set has several applications in the fields of science, engineering, and computer science. One application of the resolving set problem includes navigation robots, chemical structures, and supply chain management. Suppose the set $ W = \left\{{s}
Ridho Alfarisi   +2 more
doaj   +1 more source

Spectral ordering and 2-switch transformations [PDF]

open access: yesThe American Journal of Combinatorics, 2022
We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases.
Elismar Oliveira   +2 more
doaj  

Conflict-Free Vertex-Connections of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang   +5 more
doaj   +1 more source

A Complete Characterisation of Vertex-multiplications of Trees with Diameter 5

open access: yesTheory and Applications of Graphs, 2021
For a connected graph $G$, let $\mathscr{D}(G)$ be the family of strong orientations of $G$; and for any $D\in\mathscr{D}(G)$, we denote by $d(D)$ the diameter of $D$. The $\textit{orientation number}$ of $G$ is defined as $\bar{d}(G)=\min\{d(D)\mid D\in
Willie Wong, Eng Guan Tay
doaj   +1 more source

Home - About - Disclaimer - Privacy