Results 21 to 30 of about 67,461 (315)
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
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Hobbs, Arthur +2 more
openaire +1 more source
Graph-Based Divide and Conquer Method for Parallelizing Spatial Operations on Vector Data
Remote Sensing, 2014 In computer science, dependence analysis determines whether or not it is safe to parallelize statements in programs. In dealing with the data-intensive and computationally intensive spatial operations in processing massive volumes of geometric features ...
Xiaochen Kang, Xiangguo Lin
doaj +1 more source
Graph Structures in Bipolar Neutrosophic Environment
Mathematics, 2017 A bipolar single-valued neutrosophic (BSVN) graph structure is a generalization of a bipolar fuzzy graph. In this research paper, we present certain concepts of BSVN graph structures.
Muhammad Akram +2 more
doaj +1 more source