• Journal of applied mathematics & informatics
• /
• 제33권5_6호
• /
• pp.545-557
• /
• 2015

A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we define two new operation on vague graphs namely normal product and tensor product and study about the degree of a vertex in vague graphs which are obtained from two given vague graphs G₁ and G₂ using the operations cartesian product, composition, tensor product and normal product. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large vague graph as a combination of small, vague graphs and to derive its properties from those of the smaller ones.

• Journal of applied mathematics & informatics
• /
• 제41권5호
• /
• pp.1145-1153
• /
• 2023

The notion of maximal product of two fuzzy graphs was introduced by Radha and Arumugam in 2015 and the notion of balanced fuzzy graph was introduced by Al-Hawary in 2011. In this paper, we give a modification of the maximal product definition, which we call maximal strong product. We also introduce the relatively new notion of maximal-balanced fuzzy graphs. We give necessary and sufficient conditions for the maximal strong product of two balanced (resp., maximal-balanced) fuzzy graphs to be balanced (resp., maximal-balanced) and we prove that these two independent notions are preserved under isomorphism.

• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.469-477
• /
• 2013

Pattabiraman and Paulraja [K. Pattabiraman, P. Paulraja, Vertex and edge PI indices of the generalized hierarchical product of graphs, Discrete Appl. Math. 160 (2012) 1376- 1384] obtained exact formulas for the vertex and edge PI indices of generalized hierarchical product of graphs. The aim of this note is to improve the main results of this paper.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제16권4호
• /
• pp.359-367
• /
• 2009

The graph of the parallelogram law is well known, which gives rise to the characterization of an inner product space among normed linear spaces [6]. In this paper we will sketch graphs of its deformations according to our previous paper [7, Theorem 3.1 and 3.2]; each one of which characterizes an inner product space among normed linear spaces. Consequently, the graphs of some classical characterizations of an inner product space follow easily.

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.175-190
• /
• 2019

In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of the product of arbitrary graphs G and H based on their respective clique numbers.

• Kyungpook Mathematical Journal
• /
• 제45권4호
• /
• pp.561-570
• /
• 2005

Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The properties of such algebras can be obtained by studying this kind of graphs ([4], [5]). In [1], the author showed that a weak crossed product is Frobenius and its restricted subalgebra is symmetric if and only if its associated graph has a unique maximal vertex. A special construction of these graphs came naturally and was known as standard lower subtractive graph. It was a deep question that when such a special graph possesses unique maximal vertex? This work is to answer the question partially and to give a particular characterization for such graphs at which the corresponding algebras are isomorphic. A graph that follows the mentioned characterization is called flexible. Flexibility is to some extend a generalization of the so-called Coxeter groups and its weak Bruhat ordering.

• Kyungpook Mathematical Journal
• /
• 제57권2호
• /
• pp.301-307
• /
• 2017

In this paper, we solve the following four graph equations $L^k(G)=H{\oplus}J$; $M(G)=H{\oplus}J$; ${\bar{L^k(G)}}=H{\oplus}J$ and ${\bar{M(G)}}=H{\oplus}J$, where J is $nK_2$ for $n{\geq}1$. Here, the equality symbol = means the isomorphism between the corresponding graphs. In particular, we shall obtain all pairs of graphs (G, H), which satisfy the above mentioned equations, upto isomorphism.

• Journal of the Korean Data and Information Science Society
• /
• 제19권4호
• /
• pp.1289-1295
• /
• 2008

We find the generalized characteristic polynomial of graphs G($F_{1},F_{2},{\cdots},F_{v}$) the semi-zigzag product of G and ${\{F_{i}\}^{v}_{i=1}$ obtained from G by replacing vertices by circulant graphs of vertices and joining $F_{i}$'s along the edges of G. These graphs contain discrete tori and are key examples in the study of network model.

• Korean Journal of Mathematics
• /
• 제31권4호
• /
• pp.485-494
• /
• 2023

The degree of hesitancy of a vertex in a hesitancy fuzzy graph depends on the degree of membership and non-membership of the vertex. We define a new class of hesitancy fuzzy graph, the intuitionistic hesitancy fuzzy graph in which the degree of hesitancy of a vertex is independent of the degree of its membership and non-membership. We introduce the idea of β-product of a pair of hesitancy fuzzy graphs and intuitionistic hesitancy fuzzy graphs and prove certain results based on this product.

• Journal of applied mathematics & informatics
• /
• 제42권2호
• /
• pp.283-290
• /
• 2024

In this article, a new operation on product fuzzy graphs (PFGs) is provide; namely β-product. We give sufficient conditions for the β-product of two PFGs to be strong and we prove if the β-product of two PFGs is complete, then one of them is strong. We also study the unbiased notion of the class of PFGs and necessary and sufficient conditions for the β-product to be unbiased are given.