Results 91 to 100 of about 3,844 (297)
Graphs obtained from collections of blocks
Electronic Journal of Graph Theory and Applications, 2015 Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant +2 more
doaj +1 more source
Boosting Vertex-Cut Partitioning for Streaming Graphs
2016 IEEE International Congress on Big Data (BigData Congress), 2016 While the algorithms for streaming graph partitioning are proved promising, they fall short of creating timely partitions when applied on large graphs. For example, it takes 415 seconds for a state-of-the-art partitioner to work on a social network graph with 117 millions edges.
Hooman Peiro Sajjad +4 more
openaire +3 more sources
Advanced Materials, EarlyView.Co1/3TaS2${\rm Co}_{1/3}{\rm TaS}_{2}$ hosts a triple‐Q noncoplanar antiferromagnetic state with coexisting Z3${\rm Z}_3$ electronic nematicity. We report rotational hysteresis observed in both magnetoresistance and magnetic torque, revealing strongly pinned in‐plane weak ferromagnetic moments in the triple‐Q phase and the magnetism‐driven nature of ...
Joonyoung Choi +5 more
wiley +1 more source
Variations on Graph Products and Vertex Partitions
, 2009 In this thesis we investigate two graph products called double vertex graphs and complete double vertex graphs, and two vertex partitions called dominator partitions and rankings.
Jacob, Jobby
core
On s-harmonic functions on cones
Bruno Pini Mathematical Analysis Seminar, 2019 We deal with non negative functions which are s-harmonic on a given cone of the n-dimensional Euclidean space with vertex at zero, vanishing on the complementary.
Stefano Vita
doaj +1 more source
Tailoring Phonon‐Driven Responses in α‐MoO3 through Isotopic Enrichment
Advanced Materials, EarlyView.ABSTRACT The implementation of polaritonic materials into nanoscale devices requires selective tuning of parameters to realize desired spectral or thermal responses. One robust material, α‐MoO3, an orthorhombic crystal boasting three distinct phonon dispersions, provides three polaritonic dispersions of hyperbolic phonon polaritons (HPhPs) across the ...
Thiago S. Arnaud +31 more
wiley +1 more source
, 2011 We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lovász, Catlin, Kostochka and Rabern.
openaire +2 more sources
On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs [PDF]
The Electronic Journal of Combinatorics, 2006 For a fixed graph $H$ on $k$ vertices, we investigate the graphs, $G$, such that for any partition of the vertices of $G$ into $k$ color classes, there is a transversal of that partition inducing $H$. For every integer $k\geq 1$, we find a family ${\cal F}$ of at most six graphs on $k$ vertices such that the following holds.
openaire +2 more sources
Hierarchical Structure and Fabrication of Functionally Graded Biointerfaces in the Mussel Byssus
Advanced Materials Interfaces, EarlyView.The byssus is a fibrous protein‐based holdfast consisting of mechanically distinct interfaces, which mussels use to anchor their soft living tissue to hard seashore surfaces. Here, multiscale methodologies were used to elucidate the compositional and structural features underlying these functionally graded interfaces and how they are fabricated through
Lucia Youssef +4 more
wiley +1 more source
Partitioning 3-colored complete graphs into three monochromatic cycles
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core