Results 21 to 30 of about 696,277 (238)
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs [PDF]
Opuscula Mathematica, 2016 Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\).
Magda Dettlaff +2 more
doaj +1 more source
Two Complex Graph Operations and their Exact Formulations on Topological Properties
Complexity, 2022 Graph operations are utilized for developing complicated graph structures from basic graphs, and these basic graphs can help to understand the properties of complex networks. While on the other side, the topological descriptor is known as a numeric value
Shehla Hameed +4 more
doaj +1 more source
Uniform subdivision algorithms for curves and surfaces [PDF]
, 1988 A convergence analysis for studying the continuity and differentiability of limit curves generated by uniform subdivision algorithms is presented. The analysis is based on the study of corresponding difference and divided difference algorithms.
Gregory, JA, Dyn, N, Levin, D
core +4 more sources
Secure monophonic domination of graphs [PDF]
Journal of HyperstructuresLet G = (V, E) be a connected graph. A monophonic dominating set M is said to be a secure monophonic dominating set Sm (abbreviated as SMD set) of G if for each v∈V \M there exists u∈M such that v is adjacent to u and Sm = {M \(u)} ∪{v} is a monophonic ...
K Sunitha, D Divya
doaj +1 more source
Smarandache-Zagreb Index on Three Graph Operators [PDF]
, 2010 Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source
REGULAR NUMBER OF SUBDIVISION OF LINE GRAPH OF A GRAPH
, 2022 The regular number of subdivision of line graph is the minimum number of subsets in to which the set of edges ...
Kalshetti Swati Mallinath, Vishwas
core +1 more source
On Pathos Lict Subdivision of a Tree [PDF]
, 2010 Let G be a graph and E1 ⊂ E(G). A Smarandachely E1-lict graph nE1 (G) of a graph G is the graph whose point set is the union of the set of lines in E1 and the set of cutpoints of G in which two points are adjacent if and only if the corresponding lines ...
Iramma, M.Kadakol, Mirajkar, Keerthi G.
core +1 more source
IEEE Access, 2018 The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj +1 more source
First General Zagreb Co-Index of Graphs under Operations
Journal of Mathematics, 2022 Topological indices are graph-theoretic parameters which are widely used in the subject of chemistry and computer science to predict the various chemical and structural properties of the graphs respectively.
Muhammad Javaid +4 more
doaj +1 more source
First reformulated Zagreb indices of some classes of graphs
Karpatsʹkì Matematičnì Publìkacìï, 2018 A topological index of a graph is a parameter related to the graph; it does not depend on labeling or pictorial representation of the graph. Graph operations plays a vital role to analyze the structure and properties of a large graph which is derived ...
V. Kaladevi +2 more
doaj +1 more source