Results 101 to 110 of about 617,805 (269)
Journal of Graph Theory, EarlyView.ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Bipartite graph bundles with connected fibres
, 2019 Let G be a finite connected simple graph. The isomorphism classes of graph bundles and graph coverings over G have been enumerated by Kwak and Lee. Recently, Archdeacon and others characterised bipartite coverings of G and enumerated the isomorphism ...
Kwak, JH, Lee, J, Hong, SP
core +1 more source
Discrete Mathematics, 2000 The authors study coverings of non-bipartite graphs by bipartite graphs. In particular, they enumerate regular bipartite coverings for orders which are twice a prime.
Archdeacon, D +3 more
openaire +3 more sources
The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley +1 more source
, 2018 <p>Bipartite Network Analysis</p> <p>The Bipartite Network analysis app was created with Shiny and Bipartite package for R. The app was made to visualise a bipartite network and generate nestedness indices for student projects.</p ...
Greenville, A.C. (8145069) +1 more
core +1 more source
Journal of the Science of Food and Agriculture, EarlyView.Abstract BACKGROUND Intercropping of legumes with cereals enhances resilience, resource efficiency, and nutritional quality in food systems, yet few studies have integrated yield stability with grain quantity and post‐harvest processability. Lentils (Lens culinaris Medik.) and hull‐less barley (Hordeum vulgare L. var.
Filippo Carmenati +6 more
wiley +1 more source
On the determinant of bipartite graphs
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
Networks, EarlyView.ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs +2 more
wiley +1 more source
Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks
Networks, EarlyView.ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone +3 more
wiley +1 more source