Results 41 to 50 of about 507 (84)
SIMPLE GRAPHOIDAL COVERING NUMBER OF PRODUCT OF GRAPHS
, 2016 A graphoidal cover of G is a set ψ of (not necessarily open) paths in G, such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ.
G. V. Narayanan, J. Suseela, R. Kala
semanticscholar +1 more source
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of Mathematics, Volume 2025, Issue 1, 2025.A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions.
M. A. AbdAllah +4 more
wiley +1 more source
Weak Total Resolvability In Graphs
Discussiones Mathematicae Graph Theory, 2016 A vertex v ∈ V (G) is said to distinguish two vertices x, y ∈ V (G) of a graph G if the distance from v to x is di erent from the distance from v to y.
Casel Katrin +3 more
doaj +1 more source
Generalized 4-connectivity of hierarchical star networks
Open Mathematics, 2022 The connectivity is an important measurement for the fault-tolerance of a network. The generalized connectivity is a natural generalization of the classical connectivity. An SS-tree of a connected graph GG is a tree T=(V′,E′)T=\left(V^{\prime} ,E^{\prime}
Wang Junzhen, Zou Jinyu, Zhang Shumin
doaj +1 more source
, 2014 The bondage number $b(G)$ of a nonempty graph $G$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. Here we study the bondage number of some grid-like
Bauer +18 more
core +1 more source
A Note on the Thue Chromatic Number of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2018 A sequence is called non-repetitive if none of its subsequences forms a repetition (a sequence r1r2⋯r2n such that ri = rn+i for all 1 ≤ i ≤ n). Let G be a graph whose vertices are coloured.
Peterin Iztok +3 more
doaj +1 more source
Remarks on a conjecture about Randic index and graph radius
, 2013 LetG be a nontrivial connected graph. The radiusr.G/ ofG is the minimum eccent- ricity among eccentricities of all vertices in G. The Randiindex of G is defined as R.G/D P uv2E.G/ 1 p d G.u/dG.v/ , and the Harmonic index is defined asH.G/D P uv2E.G/ 2 dG.
T. Dehghan-Zadeh +3 more
semanticscholar +1 more source
The Vertex-Rainbow Connection Number of Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same.
Li Hengzhe, Ma Yingbin, Li Xueliang
doaj +1 more source
The strong rainbow vertex-connection of graphs [PDF]
, 2012 A vertex-colored graph $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected
Li, Xueliang, Mao, Yaping, Shi, Yongtang
core
Some Observations on the Smallest Adjacency Eigenvalue of a Graph
Discussiones Mathematicae Graph Theory, 2020 In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh
Cioabă Sebastian M. +2 more
doaj +1 more source