Results 111 to 120 of about 27,017 (285)
The maximum matching extendability and factor-criticality of 1-planar graphs [PDF]
, 2022 Jiangyue Zhang, Yan Wu, Heping Zhang
openalex +1 more source
Large matchings in maximal 1-planar graphs
Discrete MathematicsIt is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such that every edge has at most one crossing.
Therese Biedl, John Wittnebel
openaire +2 more sources
On the Book Thickness of 1-Planar Graphs
, 2015 In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness
Alam, Md. Jawaherul +2 more
openaire +2 more sources
Advanced Functional Materials, EarlyView.Charge carrier concentration and mobility in TiO2, ZrO2, and HfO2 powder films are experimentally mapped as a function of temperature. The results uncover polaron‐mediated transport regimes and field‐activated conduction, enabling the design of oxide‐based electronic and energy devices with thermally tunable functionality.
Beatriz Moura Gomes +3 more
wiley +1 more source
Advanced Functional Materials, EarlyView.A reproducible synthesis to control 3D/0D phase ratios via water‐tuned solvent–antisolvent methods is presented. Enhanced scintillation yield and ultrafast decay are achieved. Defect‐driven emission mechanisms are revealed through cathodoluminescence and radioluminescence, shedding light on the underexplored role of the 0D Cs4PbBr6 and mixed 0D/3D ...
Mario Calora +18 more
wiley +1 more source
Graphs cospectral with a friendship graph or its complement [PDF]
Transactions on Combinatorics, 2013 Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$.
Alireza Abdollahi +2 more
doaj
Class two 1-planar graphs with maximum degree six or seven [PDF]
, 2011 Xin Zhang
openalex +1 more source
Advanced Functional Materials, EarlyView.Electromagnetic interference (EMI) shields consisting of polylactic acid (PLA) in layers with different concentrations of multiwalled carbon nanotubes (MWCNT) are produced using additive manufacturing. The permittivity function of layers with different filler concentrations is learned using data of homogeneous and randomly ordered shields.
Stijn De Smedt +5 more
wiley +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard [PDF]
, 2013 Sergio Cabello, Bojan Mohar
openalex +1 more source