Results 1 to 10 of about 28,633 (107)
Discrete Dynamics in Nature and Society, 2020 The modified first Zagreb connection index ZC1∗ is a graph invariant that appeared about fifty years ago within a study of molecular modeling, and after a long time, it has been revisited in two papers ((Ali and Trinajstić, 2018) and (Naji et al., 2017))
Sadia Noureen +2 more
doaj +3 more sources
PEG-POSS Star Molecules Blended in Polyurethane with Flexible Hard Segments: Morphology and Dynamics [PDF]
Molecules, 2020 A star polymer with a polyhedral oligomeric silsesquioxanne (POSS) core and poly(ethylene glycol) (PEG) vertex groups is incorporated in a polyurethane with flexible hard segments in-situ during the polymerization process. The blends are studied in terms
Konstantinos N. Raftopoulos +5 more
doaj +2 more sources
The minimal-ABC trees with B1-branches. [PDF]
PLoS ONE, 2018 The atom-bond connectivity index (or, for short, ABC index) is a molecular structure descriptor bridging chemistry to graph theory. It is probably the most studied topological index among all numerical parameters of a graph that characterize its topology.
Darko Dimitrov +2 more
doaj +2 more sources
Exploration of CPCD number for power graph
مجلة بغداد للعلوم, 2023 Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and ...
S. Anuthiya, G. Mahadevan, C. Sivagnanam
doaj +1 more source
On 1-rotational decompositions of complete graphs into tripartite graphs [PDF]
Opuscula Mathematica, 2019 Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let \(G\) be a tripartite graph with \(n\) edges, one of which is a pendent edge.
Ryan C. Bunge
doaj +1 more source
On the Bounded Partition Dimension of Some Generalised Graph Structures
Journal of Mathematics, 2022 Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ..
Wajdi Alghamdi, Muhammad Ahsan Asim
doaj +1 more source
On Acyclic Structures with Greatest First Gourava Invariant
Journal of Chemistry, 2022 Let ξ be a simple connected graph. The first Gourava index of graph ξ is defined as GO1ξ=∑μη∈Eξdμ+dη+dμdη, where dμ indicates the degree of vertex μ.
Mariam Imtiaz +4 more
doaj +1 more source
Degree resistance distance of trees with some given parameters [PDF]
Transactions on Combinatorics, 2018 The degree resistance distance of a graph $G$ is defined as $D_R(G)=\sum_ ...
Fangguo He, Xinnong Jiang
doaj +1 more source
An Approach to the Extremal Inverse Degree Index for Families of Graphs with Transformation Effect
Journal of Chemistry, 2021 The inverse degree index is a topological index first appeared as a conjuncture made by computer program Graffiti in 1988. In this work, we use transformations over graphs and characterize the inverse degree index for these transformed families of graphs.
Muhammad Asif +4 more
doaj +1 more source
On the maximal distance spectral radius of graphs without a pendent vertex
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bose, Surya Sekhar +2 more
openaire +1 more source