Results 11 to 20 of about 4,863,804 (250)
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
IEEE Access, 2022 A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +4 more sources
On Some families of Path-related graphs with their edge metric dimension
Examples and CounterexamplesLocating the origin of diffusion in complex networks is an interesting but challenging task. It is crucial for anticipating and constraining the epidemic risks. Source localization has been considered under many feasible models.
Lianglin Li, Shu Bao, Hassan Raza
doaj +4 more sources
Three-segment lateral δ-doping redistribution in GaAs pHEMTs for gate–drain field relief and improved off-state robustness [PDF]
Scientific ReportsIn GaAs pseudomorphic high-electron-mobility transistors (pHEMTs) for high-power and high-linearity radio-frequency (RF) applications, significant lateral electric-field crowding at the gate–drain edge is a common issue under high drain bias ...
Shishi Liao +4 more
doaj +2 more sources
On vertex resolvability of a circular ladder of nonagons [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 Let H=H(V,E) be a non-trivial simple connected graph with edge and vertex set E(H) and V(H), respectively. A subset D⊂V(H) with distinct vertices is said to be a vertex resolving set in H if for each pair of distinct vertices p and q in H we have d(p,u ...
Sunny Kumar Sharma, Vijay Kumar Bhat
doaj +1 more source
Computing Edge Metric Dimension of One-Pentagonal Carbon Nanocone
Frontiers in Physics, 2021 Minimum resolving sets (edge or vertex) have become an integral part of molecular topology and combinatorial chemistry. Resolving sets for a specific network provide crucial information required for the identification of each item contained in the ...
Sunny Kumar Sharma +2 more
doaj +1 more source
The dominant edge metric dimension of graphs
Electronic Journal of Graph Theory and Applications, 2023 For an ordered subset S = {v1, …, vk} of vertices in a connected graph G and an edge e′ of G, the edge metric S-representation of e′=ab is the vector rGe(e′|S)=(dG(e′,v1),…,dG(e′,vk)) , where dG(e′,vi)=min{dG(a, vi),dG(b, vi)}.
Mostafa Tavakoli +4 more
doaj +1 more source
On the edge metric dimension and Wiener index of the blow up of graphs [PDF]
, 2021 Let $G=(V,E)$ be a connected graph. The distance between an edge $e=xy$ and a vertex $v$ is defined as $\T{d}(e,v)=\T{min}\{\T{d}(x,v),\T{d}(y,v)\}.$ A nonempty set $S \subseteq V(G)$ is an edge metric generator for $G$ if for any two distinct edges ...
Afkhami, Mojgan
core +1 more source
S-metric, degree assortativity, and edge multiplicities of the multiplex.
, 2021 S-metric, degree assortativity, and edge multiplicities of the multiplex.
Ralucca Gera (8541165) +3 more
core +2 more sources
DIMENSI METRIK GRAF HASIL OPERASI JEMBATAN DARI CATERPILLAR HOMOGEN DAN POT BUNGA DIPERUMUM
Majalah Ilmiah Matematika dan Statistika, 2022 The metric dimension is a concept that has many applications, such as robotic navigation. This concept will distinguish each vertex of a graph based on some vertices. The distinguishing vertices are called the basis of the graph.
Gusma Hidayanti +3 more
doaj +1 more source
ComTech, 2022 In a public facility or private office where many people can get together, a fire detection device is a mandatory tool as an emergency alarm in the facility. However, the expense of the installation of the device is a troublesome matter. So, optimization
Asmiati +3 more
doaj +1 more source