Results 71 to 80 of about 413,829 (102)
Mutual-visibility and general position sets in Sierpiński triangle graphs [PDF]
For a given graph \(G\), the general position problem asks for the largest set of vertices \(M \subseteq V(G)\) such that no three distinct vertices of \(M\) belong to a common shortest path in \(G\).
Vesel, Aleksander, Korže, Danilo
core +1 more source
On some metric properties of supertoken graphs
In this paper, we construct two infinite families of graphs and , where, in both cases, a vertex label is with . We provide a tight lower bound on the metric dimension of .
Baskoro, Edy Tri +3 more
core +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
Sierpiński graphs as spanning subgraphs of Hanoi graphs
Open Mathematics, 2013 Hinz Andreas +2 more
doaj +1 more source
Об эквивалентности двух гипотез о простых числах
, 1959 [Sierpiński W.; Sierpinski Waclaw; Sierpiński Wacław; Серпински Вацлав; Серпинский В.]French.
Sierpiński, W.
core
О равных суммах различных кубов натуральных чисел
, 1959 [Sierpiński W.; Sierpinski Waclaw; Sierpiński Wacław; Серпински Вацлав; Серпинский В.]French.
Sierpiński, W.
core
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
Median computation in graphs using consensus strategies [PDF]
Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of profiles.
Changat, M. +2 more
core
ON EV-DEGREE and VE-DEGREE BASED TOPOLOGICAL PROPERTIES of the SIERPIŃSKI GASKET FRACTAL
, 2019 In chemistry, pharmacology, medicine and physics molecular graphs have been used to model molecular substances, networks and fractals. Topological indices have been derived from the molecular graphs of chemical compounds, networks and fractals ...
Yamaç, Kerem, Cancan, Murat
core