Results 1 to 10 of about 974,445 (260)
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2018 In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj +20 more sources
Domination game: Effect of edge contraction and edge subdivision [PDF]
Discussiones Mathematicae Graph Theory, 2023 Summary: In this paper the behavior of the game domination number \(\gamma_g(G)\) and the Staller start game domination number \(\gamma_g^\prime(G)\) by the contraction of an edge and the subdivision of an edge are investigated. Here we prove that contracting an edge can decrease \(\gamma_g(G)\) and \(\gamma_g^\prime(G)\) by at most two, whereas ...
Tijo James, Ambat Vijayakumar
doaj +3 more sources
Edge subdivision schemes and the construction of smooth vector fields [PDF]
ACM Transactions on Graphics, 2006 Vertex- and face-based subdivision schemes are now routinely used in geometric modeling and computational science, and their primal/dual relationships are well studied. In this paper, we interpret these schemes as defining bases for discrete differential 0- resp. 2-forms , and complete the picture by introducing
Peter Schröder +2 more
exaly +4 more sources
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 +4 more sources
Barycentric Subdivision of Cayley Graphs With Constant Edge Metric Dimension
IEEE Access, 2020 A motion of a robot in space is represented by a graph. A robot change its position from point to point and its position can be determined itself by distinct labelled landmarks points.
Ali N. A. Koam, Ali Ahmad
doaj +3 more sources
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 +3 more sources
Spectra of Subdivision Vertex-Edge Join of Three Graphs
Mathematics, 2019 In this paper, we introduce a new graph operation called subdivision vertex-edge join (denoted by G 1 S ▹ ( G 2 V ∪ G 3 E ) for short), and then the adjacency spectrum, the Laplacian spectrum and the signless Laplacian spectrum of
Fei Wen, You Zhang, Muchun Li
doaj +3 more sources
Polynomial-Based Non-Uniform Ternary Interpolation Surface Subdivision on Quadrilateral Mesh
Mathematics, 2023 For non-uniform control polygons, a parameterized four-point interpolation curve ternary subdivision scheme is proposed, and its convergence and continuity are demonstrated.
Kaijun Peng, Jieqing Tan, Li Zhang
doaj +1 more source
Introduction to dominated edge chromatic number of a graph [PDF]
Opuscula Mathematica, 2021 We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph \(G\), is a proper edge coloring of \(G\) such that each color class is dominated by at least one edge of \(G\).
Mohammad R. Piri, Saeid Alikhani
doaj +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +2 more sources