Results 81 to 90 of about 110,665 (282)
From the Ising and Potts models to the general graph homomorphism polynomial
, 2015 In this note we study some of the properties of the generating polynomial for homomorphisms from a graph to at complete weighted graph on $q$ vertices.
Markström, Klas
core +1 more source
Advanced Robotics Research, EarlyView.This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
Chromatic Schultz and Gutman Polynomials of Jahangir Graphs J2,m and J3,m
Journal of Applied Mathematics, 2023 Topological polynomial and indices based on the distance between the vertices of a connected graph are widely used in the chemistry to establish relation between the structure and the properties of molecules.
Ramy Shaheen +2 more
doaj +1 more source
Strong Proton‐Phonon Coupling Drives Fast Ion Transport in Perovskites
Advanced Science, EarlyView.Experimental and computational phonon analysis of ABO3‐type proton conductor BaSnO3 shows that substitution on the B‐site with yttrium forms an imaginary phonon mode which is instrumental for the function as proton conductor. This overcompensates the adverse proton trapping effect of the yttrium.
Alexey Rulev +8 more
wiley +1 more source
Homomorphism and sigma polynomials
International Journal of Mathematics and Mathematical Sciences, 1995 By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress ...
Richard Alan Gillman
doaj +1 more source
Journal of Mathematics, 2021 Graph theory has provided a very useful tool, called topological index, which is a number from the graph M with the property that every graph N isomorphic to M value of a topological index must be same for both M and N.
Muhammad Irfan +4 more
doaj +1 more source
Graph characterising polynomials
Discrete Mathematics, 1999 A graph invariant is a function \(f\) from the class of all graphs into a commutative ring \(R\) such that \(f\) takes the same value on isomorphic graphs. If \(R\) is a ring of polynomials in one or more variables, the invariant \(f\) is called an invariant polynomial for graphs. If \(f\) satisfies the converse condition that \(f(G)=f(H)\) implies \(G\
openaire +2 more sources
, 2011 A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the graphs which are polynomials in the pattern polynomial graph have been studied.
Reddy, A. Satyanarayana +1 more
openaire +2 more sources
Advanced Science, EarlyView.CellPolaris decodes how transcription factors guide cell fate by building gene regulatory networks from transcriptomic data using transfer learning. It generates tissue‐ and cell‐type‐specific networks, identifies master regulators in cell state transitions, and simulates TF perturbations in developmental processes.
Guihai Feng +27 more
wiley +1 more source
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS [PDF]
Journal of Algebraic Systems, 2015 Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set.
Saeid Alikhani, Sommayeh Jahari
doaj +1 more source