Results 61 to 70 of about 502 (87)

Characterizations of the Direct Sum of Two Difference - Mean Fuzzy Graphs

Indian Journal of Science and Technology
Objectives: 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

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

Cardinality and Isomorphic Properties of Hajós Graphs and Hajós Fuzzy Graphs

Indian Journal of Science and Technology
Objectives: 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

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, Saleh A, Ismail R, M RS, Alameri A.   +4 more
europepmc   +1 more source

One-Three Join: A Graph Operation and Its Consequences

Discussiones Mathematicae Graph Theory, 2017
In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
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, Henning Michael A., Topp Jerzy   +2 more
doaj   +1 more source

Determining Finite Connected Graphs Along the Quadratic Embedding Constants of Paths

, 2019
The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Baskoro, Edy Tri, Obata, Nobuaki
core  

Equistarable graphs and counterexamples to three conjectures on equistable graphs

, 2014
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$.
Milanič, Martin, Trotignon, Nicolas
core