Results 261 to 264 of about 473,067 (264)
Some of the next articles are maybe not open access.
On strong geodeticity in the lexicographic product of graphs
AIMS MathematicsThe strong geodetic number of a graph and its edge counterpart are recent variations of the pioneering geodetic number problem. Covering every vertex and edge of $ G $, respectively, using a minimum number of vertices and the geodesics connecting them ...
S. Gajavalli, A. Berin Greeni
semanticscholar +1 more source
Locally identifying coloring of strong product of graphs
Discrete Mathematics, Algorithms and ApplicationsA proper vertex coloring of a graph [Formula: see text] is said to be locally identifying (lid-coloring) if for any pair [Formula: see text] of adjacent vertices with distinct closed neighborhoods, the sets of colors in the closed neighborhoods of [Formula: see text] and [Formula: see text] are different.
R. Pavithra, T. Reji
openaire +1 more source
On degree-based topological descriptors of strong product graphs
, 2016S. Akhter, M. Imran
semanticscholar +1 more source
On super 3-restricted edge connectivity of regular strong product graphs with girth at least four
2010 International Conference on Networking and Digital Society, 2010Yingying Qin, Zhiping Xiong, Jingyu Wang
semanticscholar +1 more source