Results 61 to 70 of about 59,275 (246)
New graph classes characterized by weak vertex separators and two-pairs
AKCE International Journal of Graphs and Combinatorics, 2017 A set of vertices whose deletion from a graph would increase the distance between two remaining vertices is called a weak vertex separator of the graph. Two vertices form a two-pair if all chordless paths between them have length .
Terry A. McKee
doaj +1 more source
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
Dense subgraphs induced by edge labels
Machine Learning, 2023 AbstractFinding densely connected groups of nodes in networks is a widely-used tool for analysis in graph mining. A popular choice for finding such groups is to find subgraphs with a high average degree. While useful, interpreting such subgraphs may be difficult.
Iiro Kumpulainen, Nikolaj Tatti
openaire +3 more sources
Finding a maximum induced degenerate subgraph faster than 2^n
, 2012 In this paper we study the problem of finding a maximum induced d-degenerate subgraph in a given n-vertex graph from the point of view of exact algorithms. We show that for any fixed d one can find a maximum induced d-degenerate subgraph in randomized (2-
Pilipczuk, Marcin, Pilipczuk, Michał
core +1 more source
Recent Advances in NASICON‐Type Electrolytes for Solid‐State Metal Batteries
Carbon Energy, EarlyView.NASICON‐type solid electrolytes are one of the potential candidates for solid‐state rechargeable batteries, which are paid much attention by both academic and industrial communities. ABSTRACT Compared to traditional liquid electrolyte batteries, solid metal batteries offer advantages such as a wide operating temperature range, high energy density, and ...
Jingrui Kang +17 more
wiley +1 more source
Strong ƒ-Star Factors of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let G be a graph and f : V (G) → {2, 3, . . .}. A spanning subgraph F is called strong f-star of G if each component of F is a star whose center x satisfies degF (x) ≤ ƒ(x) and F is an induced subgraph of G.
Yan Zheng
doaj +1 more source
Embedability between right-angled Artin groups
, 2011 In this article we study the right-angled Artin subgroups of a given right-angled Artin group. Starting with a graph $\gam$, we produce a new graph through a purely combinatorial procedure, and call it the extension graph $\gam^e$ of $\gam$. We produce a
Farb +3 more
core +2 more sources
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, EarlyView.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Deep Underground Science and Engineering, EarlyView.A holistic utilization system that integrates large‐scale CO2 storage, water recovery, heat extraction, hydrogen production, and energy storage is presented. The whole system can be further divided into upstream industries (CO2‐enhanced water recovery module), midstream industries (green‐hydrogen production module), and downstream industries (energy ...
Huiling Ci +3 more
wiley +1 more source
A fundamental theorem on graph operators
Mathematics OpenA graph operator is a function [Formula: see text] defined on some set of graphs such that whenever two graphs G and H are isomorphic, written [Formula: see text], then [Formula: see text].
Severino V. Gervacio
doaj +1 more source