Results 41 to 50 of about 5,946 (233)

Universal Rigidity of Complete Bipartite Graphs [PDF]

open access: yesDiscrete & Computational Geometry, 2017
DCG published ...
Robert Connelly, Steven J. Gortler
openaire   +2 more sources

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

open access: yesJournal of Graph Algorithms and Applications, 2020
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings.
Patrizio Angelini   +3 more
doaj   +1 more source

Homomorphisms of infinite bipartite graphs onto complete bipartite graphs [PDF]

open access: yesCzechoslovak Mathematical Journal, 1983
Let B be a bipartite graph on the vertex sets C, D. A homomorphism \(\phi\) of B onto a complete bipartite graph \(K_{r,s}\) is said to be bicomplete if \(\phi(x)=\phi(y)\) only if either both x, y belong to C, or both x, y belong to D. For a connected bipartite graph B, the author defines the parameter \(\beta_ 0(B)\) as the supremum of all values of ...
openaire   +2 more sources

Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD

open access: yesAdvanced Materials, EarlyView.
Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo   +6 more
wiley   +1 more source

On the Line Graph of the Complete Bipartite Graph

open access: yesThe Annals of Mathematical Statistics, 1964
In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case $m = n$, this question had been settled by Shrikhande [5] (see also [1], [2] and [3]), who proved that the answer was yes ...
openaire   +3 more sources

Data‐Driven Materials Science for Energy‐Sustainable Applications

open access: yesAdvanced Materials, EarlyView.
Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley   +1 more source

ABC energies and spectral radii of some graph operations

open access: yesFrontiers in Physics, 2022
The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj   +1 more source

A Phase‐Resolved Geometric Deep Learning Framework Maps Structural Determinants of Disease‐Associated Protein Aggregation and Guides Suppressor Design

open access: yesAdvanced Science, EarlyView.
SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio   +6 more
wiley   +1 more source

On dynamic colouring of cartesian product of complete graph with some graphs

open access: yesJournal of Taibah University for Science, 2020
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj   +2 more
doaj   +1 more source

On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs

open access: yesAlgorithms, 2023
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications.
Ahmed El-Mesady   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy