Results 81 to 90 of about 110,794 (282)
Interlace Polynomials for Multimatroids and Delta-Matroids
, 2014 We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids.
Aigner +35 more
core +1 more source
Pattern Formation in Non‐Equilibrium Architected Materials
Advanced Materials Technologies, EarlyView.This article demonstrates an artificial mechanical system ‐ a robotic metamaterial ‐ as an accessible and versatile platform within which to explore and prescribe the reaction‐diffusion driven pattern formation hitherto associated with comparatively less accessible and versatile non‐equilibrium biological and chemical systems.
Vinod Ramakrishnan, Michael J. Frazier
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
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
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
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.This review comprehensively summarizes the atomic defects in TMDs for their applications in sustainable energy storage devices, along with the latest progress in ML methodologies for high‐throughput TEM data analysis, offering insights on how ML‐empowered microscopy facilitates bridging structure–property correlation and inspires knowledge for precise ...
Zheng Luo +6 more
wiley +1 more source
Linear Algebra and its Applications, 2016 As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell are equidistant from $u$. Some properties and characterizations of such graphs are studied.
openaire +4 more sources