Results 31 to 40 of about 723,682 (282)
几个图运算下的图的惯性指数的界(Bounding the inertia of graphs under some graph operations)
Zhejiang Daxue xuebao. Lixue ban, 2016 The inertia of a graph G is defined to be the triple In(G) = {i+ (G), i- (G)，i0 (G)}，where i+ (G)，i-(G),i0 (G) are the numbers of positive,negative and zero eigenvalues of the adjacency matrix A(G) including multiplicities, respectively.
QUHui(曲慧), LIUWeijun(刘伟俊)
doaj +1 more source
On Powers of Some Graph Operations [PDF]
Mathematics Interdisciplinary Research, 2018 Let G*H be the product * of G and H. In this paper we determine the rth power of the graph G*H in terms of Gr, Hrand Gr*Hr, when * is the join, Cartesian, symmetric difference, disjunctive, composition, skew and corona product. Then we solve the equation
Mohamed Seoud, Hamdy Mohamed Hafez
doaj +1 more source
A Multiscale Pyramid Transform for Graph Signals [PDF]
, 2015 Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic geometric structure of ...
Faraji, Mohammad Javad +2 more
core +2 more sources
Graph operations and neighbor-integrity [PDF]
Mathematica Bohemica, 2004 Summary: Let \(G\) be a graph. A vertex subversion strategy of \(G\), say \(S\), is a set of vertices in~ \(G\) whose closed neighborhood is removed from~ \(G\). The survival-subgraph is denoted by \(G/S\). The neighbor-integrity of~ \(G\), NI\((G)\), is defined to be NI\((G) = \min _{S \subseteq V (G)} \{| S| + c (G/S)\}\), where~ \(S\) is any vertex ...
openaire +3 more sources
Reformulated F-index of graph operations
Communications in Combinatorics and Optimization, 2017 The first general Zagreb index is defined as $M_1^\lambda(G)=\sum_{v\in V(G)}d_{G}(v)^\lambda$ where $\lambda\in \mathbb{R}-\{0,1\}$. The case $\lambda=3$, is called F-index.
Hamideh Aram, Nasrin Dehgardi
doaj +1 more source
SPECTRA OF GRAPH OPERATIONS BASED ON SPLITTING GRAPH
Journal of Applied Analysis & Computation, 2023 Summary: The splitting graph \(\mathrm{SP}(G)\) of a graph \(G\) is the graph obtained from \(G\) by taking a new vertex \(u'\) for each \(u \in V(G)\) and joining \(u'\) to all vertices of \(G\) adjacent to \(u \). For a connected regular graph \(G_1\) and an arbitrary regular graph \(G_2\), we determine the adjacency (respectively, Laplacian and ...
Lu, Zhiqin, Ma, Xiaoling, Zhang, Minshao
openaire +1 more source
JUMP OPERATIONS FOR BOREL GRAPHS [PDF]
The Journal of Symbolic Logic, 2018 AbstractWe investigate the class of bipartite Borel graphs organized by the order of Borel homomorphism. We show that this class is unbounded by finding a jump operator for Borel graphs analogous to a jump operator of Louveau for Borel equivalence relations.
DAY, ADAM R, MARKS, ANDREW S
openaire +4 more sources
Reformulated First Zagreb Index of Some Graph Operations
Mathematics, 2015 The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of the end vertices of the edge minus 2. In this paper, we
Nilanjan De +2 more
doaj +1 more source
The Sigma Coindex of Graph Operations
Journal of Mathematics, 2021 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.
Yasar Nacaroglu
doaj +1 more source
Pseudodifferential Operators on Periodic Graphs [PDF]
Integral Equations and Operator Theory, 2011 22 ...
Rabinovich, Vladimir S., Roch, Steffen
openaire +3 more sources