Results 241 to 250 of about 772,522 (267)

Comparing school experience across Brazilian, Swiss, and Uruguayan adolescents: a measurement invariance study

open access: yes
Luquine CD   +8 more
europepmc   +1 more source

Metric and strong metric dimension in commuting graphs of finite groups

Communications in Algebra, 2022
The commuting graph of a finite group is the undirected graph whose vertex set is the set of all elements of this group, and two distinct vertices are adjacent if they commute.
Liangliang Zhai   +3 more
semanticscholar   +2 more sources

The Forcing Strong Metric Dimension of a Graph

open access: yesContributions to Discrete Mathematics, 2017
For any two vertices u, v in a connected graph G, the interval I(u, v) consists of all vertices which are lying in some u − v shortest path in G. A vertex x in a graph G strongly resolves a pair of vertices u, v if either u ∈ I(x, v) or v ∈ I(x, u).
R. Lenin, K. Kathiresan, M. Bača
semanticscholar   +2 more sources

On Distance and Strong Metric Dimension of the Modular Product

open access: yesBulletin of the Malaysian Mathematical Sciences Society
The modular productG⋄H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G ...
Cong X. Kang   +3 more
semanticscholar   +4 more sources

Fault-Tolerant Strong Metric Dimension of Rooted Product Graphs

Communications on Applied Nonlinear Analysis
The concept of fault tolerance in graph theory is critical in designing robust networks, ensuring that essential graph properties are preserved despite failures of vertices or edges.
H. Prathab   +2 more
semanticscholar   +2 more sources

Metric and strong metric dimension in intersection power graphs of finite groups

Communications in Algebra
Let G be a finite group and let e be its identity element. The intersection power graph of G is the undirected graph with vertex set G, in which two distinct vertices x and y are adjacent if either 〈x〉∩〈y〉≠{e} or one of x and y is e.
Xuanlong Ma, Ruiqin Fu
semanticscholar   +2 more sources

Metric and Strong Metric Dimension in Cozero-Divisor Graphs

Mediterranean Journal of Mathematics, 2021
Several graphs are associated with commutative rings and they are used as combinatorial tools to study algebraic properties of commutative rings. Let \(R\) be a commutative ring with nonzero identity and \(W^*(R)\) be the set of all nonzero and nonunit elements of \(R.\) The cozero-divisor graph of \(R,\) denoted by \(\Gamma^\prime (R)\) is a graph ...
R. Nikandish, M. Nikmehr, M. Bakhtyiari
semanticscholar   +2 more sources

Home - About - Disclaimer - Privacy