Results 61 to 70 of about 507 (84)
Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph when ...
Tadeja Kraner Šumenjak +3 more
doaj +1 more source
Characterizations of the Direct Sum of Two Difference - Mean Fuzzy Graphs
Indian Journal of Science and TechnologyObjectives: This study presents a new type of fuzzy graph known as the difference mean fuzzy graph by introducing difference mean edge. Methodology: In this paper, difference mean edge in a fuzzy graph is defined by considering the relationship between ...
K. Radha, S. S. Harini
semanticscholar +1 more source
Cardinality and Isomorphic Properties of Hajós Graphs and Hajós Fuzzy Graphs
Indian Journal of Science and TechnologyObjectives: Fuzzy graphs allow uncertainty in the ideas characterizing vertices and edges to be included when modelling real-world scenarios into graph models.
K. Radha, A. J. Kingsly
semanticscholar +1 more source
Niche Hypergraphs of Products of Digraphs
Discussiones Mathematicae Graph Theory, 2020 If D = (V, A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ={e⊆V||e|≥2∧∃ υ∈V:e=ND−(υ)∨e=ND+(υ)}{\cal E} = \{ {e \subseteq V| | e | \ge 2 \wedge \exists \, \upsilon \in V:e = N_D^ - ( \upsilon ) \vee e = N_D^ + ( \upsilon ...
Sonntag Martin, Teichert Hanns-Martin
doaj +1 more source
On Distance Magic Harary Graphs
, 2018 This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for
Paramasivam, Krishnan, Prajeesh, A V
core
On alpha labeling of tensor product of paths and cycles. [PDF]
Heliyon, 2023 L U, G R.
europepmc +1 more source
Computational analysis for eccentric neighborhood Zagreb indices and their significance. [PDF]
Heliyon, 2023 Ahmed H +4 more
europepmc +1 more source
A study on the pendant number of graph products
Acta Universitatis Sapientiae: Informatica, 2019 A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Πp is the minimum number of end vertices of paths in a path decomposition of G.
Sebastian Jomon K. +3 more
doaj +1 more source
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
Discussiones Mathematicae - General Algebra and Applications, 2019 In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +1 more source
On Accurate Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of
Cyman Joanna +2 more
doaj +1 more source