Results 51 to 60 of about 7,067 (209)
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
Algorithms, 2019 The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article.
Hristo N. Djidjev +4 more
doaj +1 more source
Coloring Rings in Species [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species.
Jacob White
doaj +1 more source
Evaluating the rank generating function of a graphic 2-polymatroid
, 2006 We consider the complexity of the two-variable rank generating function, $S$, of a graphic 2-polymatroid. For a graph $G$, $S$ is the generating function for the number of subsets of edges of $G$ having a particular size and incident with a particular ...
Noble, SD, Noble, Steven
core +1 more source
Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts
Advances in Fuzzy Systems, 2019 Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc.
Mamo Abebe Ashebo +1 more
doaj +1 more source
Further study of eccentricity based indices for benzenoid hourglass network
Heliyon, 2023 Topological Indices are the mathematical estimate related to atomic graph that corresponds biological structure with several real properties and chemical activities. These indices are invariant of graph under graph isomorphism.
Hifza Iqbal +6 more
doaj +1 more source
On the Degeneracy of the Orbit Polynomial and Related Graph Polynomials
Symmetry, 2020 The orbit polynomial is a new graph counting polynomial which is defined as OG(x)=∑i=1rx|Oi|, where O1, …, Or are all vertex orbits of the graph G. In this article, we investigate the structural properties of the automorphism group of a graph by using several novel counting polynomials.
Modjtaba Ghorbani +2 more
openaire +3 more sources
Integral zeroes of Krawtchouk polynomials [PDF]
, 2012 This thesis was submitted for the degree of Master of Philosophy and awarded by Brunel University.Krawtchouk polynomials appear in many various areas of mathematics starting from discrete mathematics (e.g., in coding theory), association schemes, and in ...
Alenezi, Ahmad M
core
Zagreb Polynomials of Certain Families of Dendrimer Nanostars
Tikrit Journal of Pure Science, 2023 Let G be a simple connected graph with vertex set V(G) and edge set E(G). The first, second and third Zagreb polynomials of G are defined as , and A dendrimer is an artificially manufactured or synthesized molecule built up from branched units ...
Nabeel E. Arif
doaj +1 more source
Explicit formulas for chromatic polynomials of some series-parallel graphs
Учёные записки Казанского университета: Серия Физико-математические науки, 2018 The main goal of our paper is to present explicit formulas for chromatic polynomials of some planar series-parallel graphs (sp-graphs). The necklace-graph considered in this paper is the simplest non-trivial sp-graph.
E.Yu. Lerner, S.A. Mukhamedjanova
doaj
Interlace polynomials of 4n-snowflake graphs
Electronic Journal of Graph Theory and Applications, 2023 In this paper, we study the interlace polynomial of a special graph with n vertices, called 4n-snowflake graph. It is similar as the friendship graph Fn of n vertices, which is made of n 3-cycles sharing one center vertex.
Jyoti Champanerkar, Aihua Li
doaj +1 more source