scholarly journals Product of Locally Primitive Graphs

2014 ◽  
Vol 2014 ◽  
pp. 1-4
Author(s):  
Amir Assari
Keyword(s):  
Tensor Product ◽  
Large Graphs ◽  
Graph Operations

Many large graphs can be constructed from existing smaller graphs by using graph operations, such as the product of two graphs. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this paper we consider the product of two locally primitive graphs and prove that only tensor product of them will also be locally primitive.

BOUNDS OF TOPOLOGICAL INDICES OF TENSOR PRODUCT OF GRAPH OPERATIONS

2017 ◽  
Vol 102 (12) ◽  
pp. 3067-3091
Author(s):  
Muhammad Imran ◽  
Shakila Baby ◽  
Hafiz Muhammad Afzal Siddiqui ◽  
Muhammad Kashif Shafiq
Keyword(s):  
Tensor Product ◽  
Topological Indices ◽  
Graph Operations

A novel graph invariant: The third leap Zagreb index under several graph operations

2019 ◽  
Vol 11 (05) ◽  
pp. 1950054 ◽  
Author(s):  
Durbar Maji ◽  
Ganesh Ghorai
Keyword(s):  
Tensor Product ◽  
Cartesian Product ◽  
Lexicographic Product ◽  
Graph Invariant ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
The Third ◽  
Graph Operations ◽  
Strong Product ◽  
Corona Product

The third leap Zagreb index of a graph [Formula: see text] is denoted as [Formula: see text] and is defined as [Formula: see text], where [Formula: see text] and [Formula: see text] are the 2-distance degree and the degree of the vertex [Formula: see text] in [Formula: see text], respectively. The first, second and third leap Zagreb indices were introduced by Naji et al. [A. M. Naji, N. D. Soner and I. Gutman, On leap Zagreb indices of graphs, Commun. Combin. Optim. 2(2) (2017) 99–117] in 2017. In this paper, the behavior of the third leap Zagreb index under several graph operations like the Cartesian product, Corona product, neighborhood Corona product, lexicographic product, strong product, tensor product, symmetric difference and disjunction of two graphs is studied.

scholarly journals The Sigma Coindex of Graph Operations

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yasar Nacaroglu
Keyword(s):  
Tensor Product ◽  
Cartesian Product ◽  
Lexicographic Product ◽  
Nonadjacent Vertex ◽  
Graph Operations ◽  
Strong Product ◽  
Mathematical Properties ◽  
Corona Product

The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex. Later, we present precise results for the sigma coindices of various graph operations such as tensor product, Cartesian product, lexicographic product, disjunction, strong product, union, join, and corona product.

scholarly journals Sharp Bounds for the Inverse Sum Indeg Index of Graph Operations

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Anam Rani ◽  
Muhammad Imran ◽  
Usman Ali
Keyword(s):  
Tensor Product ◽  
Physicochemical Properties ◽  
Cartesian Product ◽  
Total Surface Area ◽  
Sharp Bounds ◽  
Graph Operations ◽  
Strong Product ◽  
Octane Isomers ◽  
International Academy ◽  
Corona Product

Vukičević and Gasperov introduced the concept of 148 discrete Adriatic indices in 2010. These indices showed good predictive properties against the testing sets of the International Academy of Mathematical Chemistry. Among these indices, twenty indices were taken as beneficial predictors of physicochemical properties. The inverse sum indeg index denoted by ISI G k of G k is a notable predictor of total surface area for octane isomers and is presented as ISI G k = ∑ g k g k ′ ∈ E G k d G k g k d G k g k ′ / d G k g k + d G k g k ′ , where d G k g k represents the degree of g k ∈ V G k . In this paper, we determine sharp bounds for ISI index of graph operations, including the Cartesian product, tensor product, strong product, composition, disjunction, symmetric difference, corona product, Indu–Bala product, union of graphs, double graph, and strong double graph.

scholarly journals The first general Zagreb coindex of graph operations

2020 ◽  
Vol 5 (2) ◽  
pp. 109-120
Author(s):  
Melaku Berhe Belay ◽  
Chunxiang Wang
Keyword(s):  
Tensor Product ◽  
Cartesian Product ◽  
Molecular Graphs ◽  
Basic Properties ◽  
Graph Operations ◽  
Nano Structures ◽  
Product Composition ◽  
Product Of Graphs

AbstractMany chemically important graphs can be obtained from simpler graphs by applying different graph operations. Graph operations such as union, sum, Cartesian product, composition and tensor product of graphs are among the important ones. In this paper, we introduce a new invariant which is named as the first general Zagreb coindex and defined as \overline{M}^\alpha_1(G)=\Sigma_{uv\in E(\overline{G})}[d_G(u)^\alpha+d_G(v)^\alpha] , where α ∈ ℝ, α ≠ 0. Here, we study the basic properties of the newly introduced invariant and its behavior under some graph operations such as union, sum, Cartesian product, composition and tensor product of graphs and hence apply the results to find the first general Zagreb coindex of different important nano-structures and molecular graphs.

Reference Signal Based Tensor Product Expansion for EOG-Related Artifact Separation in EEG

2017 ◽  
Vol E100.A (11) ◽  
pp. 2230-2237
Author(s):  
Akitoshi ITAI ◽  
Arao FUNASE ◽  
Andrzej CICHOCKI ◽  
Hiroshi YASUKAWA
Keyword(s):  
Tensor Product ◽  
Reference Signal

On degeneracy problem of NFSRs via semi-tensor product

2020 ◽  
Author(s):  
Xinyu Zhao ◽  
Biao Wang ◽  
Shuqian Zhu ◽  
Jun-e Feng
Keyword(s):  
Tensor Product ◽  
Degeneracy Problem

On Hyper-Zagreb Index of Three Graph Operations

2019 ◽  
Vol 10 (2) ◽  
pp. 301-309
Author(s):  
A. Bharali ◽  
Amitav Doley
Keyword(s):  
Zagreb Index ◽  
Graph Operations

The Restricted Arc-Width of a Graph

10.37236/1734 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
David Arthur
Keyword(s):  
Unit Circle ◽  
Single Point ◽  
Minimum Width ◽  
Graph Operations ◽  
Function Mapping

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Barát and Hajnal on this subject and develop a generalization we call restricted arc-width. Our main results revolve around using this to bound arc-width from below and to examine the effect of several graph operations on arc-width. In particular, we completely describe the effect of disjoint unions and wedge sums while providing tight bounds on the effect of cones.

Sign in / Sign up

Export Citation Format

Share Document