Results 1 to 10 of about 507 (84)
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +2 more sources
The local vertex anti-magic coloring for certain graph operations. [PDF]
HeliyonUma L, Rajasekaran G.
europepmc +2 more sources
Second Redefined Zagreb Index of Generalized Transformation Graph
International journal of science, engineering and management, 2022 The topological indices are useful part in the investigations of quantitative structure property relationship (QSPR) and quantitative structure activity relationship (QSAR) in mathematical chemistry.
V. T, Sharan Hegde, Afshan Tarannum
semanticscholar +1 more source
Finite vertex-based resolvability of supramolecular chain in dialkyltin
Main Group Metal Chemistry, 2022 For mammals, l-valine, which is a glycogen, is an essential amino acid. A protein made of 20 amino acids, salicylidene and l-valine make the carboxylate ligand which is the base of chiral Schiff.
Zhang Xiujun +4 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2022 A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G), E(G)) if G − S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S such that (
Erker Tjaša Paj, Špacapan Simon
doaj +1 more source
Graph Operations and Neighborhood Polynomials
Discussiones Mathematicae Graph Theory, 2021 The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj +1 more source
Total Domination in Generalized Prisms and a New Domination Invariant
Discussiones Mathematicae Graph Theory, 2021 In this paper we complement recent studies on the total domination of prisms by considering generalized prisms, i.e., Cartesian products of an arbitrary graph and a complete graph.
Tepeh Aleksandra
doaj +1 more source
Structures devised by the generalizations of two graph operations and their topological descriptors
Main Group Metal Chemistry, 2022 Graph theory served in different fields of sciences, especially in chemistry in which creating complex structures and studying their enormous properties. Graph operation is a tool to construct complex chemical structures using basic graphs.
Raza Hassan +3 more
doaj +1 more source
On Order Prime Divisor Graphs of Finite Groups
Discussiones Mathematicae - General Algebra and Applications, 2021 The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source
General Randić indices of a graph and its line graph
Open Mathematics, 2023 For a real number α\alpha , the general Randić index of a graph GG, denoted by Rα(G){R}_{\alpha }\left(G), is defined as the sum of (d(u)d(v))α{\left(d\left(u)d\left(v))}^{\alpha } for all edges uvuv of GG, where d(u)d\left(u) denotes the degree of a ...
Liang Yan, Wu Baoyindureng
doaj +1 more source