Results 11 to 20 of about 157 (114)
On the planarity of line Mycielskian graph of a graph [PDF]
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 +3 more sources
The local vertex anti-magic coloring for certain graph operations. [PDF]
HeliyonThis work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
Uma L, Rajasekaran G.
europepmc +2 more sources
On the p3-hull number of kneser graphs [PDF]
, 2021 This paper considers an infection spreading in a graph; a vertex gets infected if at least two of its neighbors are infected. The P3-hull number is the minimum size of a vertex set that eventually infects the whole graph.
Torres, Pablo Daniel +14 more
core +1 more source
Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs [PDF]
, 2022 A graph whose nodes have degree \(1\) or \(3\) is called a \(\{1,3\}\)-graph. Liu and Osserman associated a polytope to each \(\{1,3\}\)-graph and studied the Ehrhart quasi-polynomials of these polytopes.
de Pina, José +5 more
core +1 more source
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
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
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