Results 61 to 70 of about 87,339 (166)

Topological Study of Zeolite Socony Mobil-5 via Degree-Based Topological Indices

Journal of Chemistry, 2021
Graph theory is a subdivision of discrete mathematics. In graph theory, a graph is made up of vertices connected through edges. Topological indices are numerical parameters or descriptors of graph.
Nouman Saeed, Kai Long, Tanweer Ul Islam, Zeeshan Saleem Mufti, Ayesha Abbas   +4 more
doaj   +1 more source

A Study on C-Exponential Mean Labeling of Graphs

Journal of Mathematics, 2022
A function h is mentioned as a C-exponential mean labeling of a graph GV,E that has s vertices and r edges if h:VG⟶1,2,3,⋯,r+1 is injective and the generated function h∗:EG⟶2,3,4,⋯,r+1 defined by h∗ab=1/ehbhb/haha1/hb−ha, for all ab∈EG, is bijective.
Thamaraiselvi Baskaran, Rajasekaran Ganapathy   +1 more
doaj   +1 more source

Recursively-regular subdivisions and applications

Journal of Computational Geometry, 2016
We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron) introducing the class of recursively-regular subdivisions.
Rafel Jaume, Günter Rote
doaj   +1 more source

Spanning subdivisions in Dirac graphs

Combinatorics, Probability and Computing, 2023
AbstractWe show that for every $n\in \mathbb N$ and $\log n\le d\lt n$ , if a graph $G$ has $N=\Theta (dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$ , then it contains a spanning subdivision of every $n$ -vertex $d$ -regular graph.
openaire   +2 more sources

Eccentricity based graph parameters of subdivision-vertex-vertex (edge-edge) join products

Ain Shams Engineering Journal
Effective utilization of graph products are essential for the development of complex networking systems. The graph product can produce a diverse array of fundamental graphs as an application.
Anam Shahzad, Muhammad Kamran Jamil, Adel Fahad Alrasheedi, Muhammad Waheed, Aisha Javed   +4 more
doaj   +1 more source

Excluding subdivisions of bounded degree graphs

, 2018
Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that contain a ...
Liu, Chun-Hung, Thomas, Robin
core  

Symmetry properties of subdivision graphs

Discrete Mathematics, 2012
The subdivision graph $S(Σ)$ of a graph $Σ$ is obtained from $Σ$ by `adding a vertex' in the middle of every edge of $\Si$. Various symmetry properties of $§(Σ)$ are studied. We prove that, for a connected graph $Σ$, $S(Σ)$ is locally $s$-arc transitive if and only if $Σ$ is $\lceil\frac{s+1}{2}\rceil$-arc transitive.
Daneshkhah, Ashraf, Devillers, Alice, Praeger, Cheryl E.   +2 more
openaire   +3 more sources

Graceful Labeling of some Join Graphs and the Subdivision of Complete Bipartite Graphs

Journal of Applied Mathematics
The join of graphs G and H, denoted by G+H, is the graph obtained from the disjoint union of G and H by joining each vertex in G to each vertex in H. An edge uw is said to be subdivided if uw is replaced by the path P:uvw, where v is the new vertex.
A. Panpa, P. Chaiprasert, C. Tisklang
doaj   +1 more source

Non - domination subdivision stable graphs

IOP Conference Series: Materials Science and Engineering, 2017
Subdividing an edge in the graph may increase the domination number or remains the same. In this paper, we introduce a new kind of graph called non - domination subdivision stable graph (NDSS). We obtain a necessary and sufficient condition for a graph to be NDSS.
M Yamuna, A Elakkiya
openaire   +1 more source

Generalized Characteristic Polynomials of Join Graphs and Their Applications

Discrete Dynamics in Nature and Society, 2017
The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G in electrical networks. LEL(G) is the Laplacian-Energy-Like Invariant of G in chemistry.
Pengli Lu, Ke Gao, Yang Yang
doaj   +1 more source