Results 11 to 20 of about 234 (95)
ON MULTIPLICATIVE K BANHATTI INDICES OF LINE GRAPHS
Scholarly Research Journal for Interdisciplinary Studies, 2021 Let G = (V,E) be a connected graph. The multiplicative K Banhatti indices of G are defined as BΠ*(G) = Que[dG(u) * dG(e)], where * is usual addition or multiplication and ue means that the vertex u and edge e are incident in G.
B. Manjunath
semanticscholar +1 more source
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
Open Chemistry, 2021 In recent years, several structure-based properties of the molecular graphs are understood through the chemical graph theory. The molecular graph GG of a molecule consists of vertices and edges, where vertices represent the atoms in a molecule and edges ...
Zhao Dongming +6 more
doaj +1 more source
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika, Volume 66, Issue 2, Page 422-447, April 2020., 2020 Abstract We study the model Gα∪G(n,p) of randomly perturbed dense graphs, where Gα is any n‐vertex graph with minimum degree at least αn and G(n,p) is the binomial random graph. We introduce a general approach for studying the appearance of spanning subgraphs in this model using absorption.
Julia Böttcher +3 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2022 The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges of an n-vertex simple graph having no H as a subgraph. Let Sℓ denote the star on ℓ + 1 vertices, and let k · Sℓ denote k disjoint copies of Sℓ. Erdős and Gallai determined
Li Sha-Sha, Yin Jian-Hua, Li Jia-Yun
doaj +1 more source
Zagreb Polynomials and Redefined Zagreb indices for the Line Graph of Carbon Nanocones
Open Journal of Mathematical Analysis, 2018 A line graph has many useful applications in physical chemistry. Topological indices are numerical parameters associated to a structure and, in combination, determine properties of the concerned material.
Saba Noreen, Atif Mahmood
semanticscholar +1 more source
EXTREMAL HYPER ZAGREB INDEX FOR TRICYCLIC GRAPHS
, 2020 For a graph G = (V (G), E(G)), the first hyper Zagreb index is defined as ∑ uv∈E(G)(d(u) + d(v)) 2, where d(v) is the degree of the vertex v. The hyper Zagreb index is a kind of extensions of Zagreb index.
Zheng-Qing Chu, M. Jamil, Aisha Javed
semanticscholar +1 more source
A Note on Packing of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy +2 more
doaj +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
Discussiones Mathematicae Graph Theory, 2023 A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element.
Borg Peter, Feghali Carl
doaj +1 more source
EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS
, 2020 Graph embedding is the mapping of a topological structure (guest graph) into another topological structure (host graph) that preserves certain required topological properties and the graph embedding ability reflects how efficiently a parallel algorithm ...
Jiangxia Liu, R. Karthik, S. R. Kumar
semanticscholar +1 more source
Rainbow spanning structures in graph and hypergraph systems
Forum of Mathematics, Sigma, 2023 We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host graph. For a collection $\mathit {\mathbf {G}}=\{G_1, G_2,\ldots , G_{
Yangyang Cheng +3 more
doaj +1 more source