Results 71 to 80 of about 96,628 (243)
4-Factor-criticality of vertex-transitive graphs [PDF]
, 2014 A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching.
Sun, Wuyang, Zhang, Heping
core
The enumeration of bipartite graphs
Discrete Mathematics, 1979 AbstractThe standard construction of graphs with n connected components is modified here for bicolored graphs by letting Sn × H act on the function space Y∗where X={1,2,…,n}, Y is the set of connected bicolored graphs, and H is the group that interchanges the vertex colors.
openaire +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
Adaptive Bipartite Consensus of Second-Order Multi-Agent Systems With Bounded Disturbances
IEEE Access, 2020 This paper investigates distributed adaptive bipartite consensus for second-order multi-agent systems (MASs) with bounded disturbances under a signed graph. Based on adaptive variable structure control strategies, an adaptive bipartite consensus protocol
Haichuan Xu +3 more
doaj +1 more source
Cyclability in bipartite graphs [PDF]
Opuscula Mathematica, 2009 Let \(G=(X,Y,E)\) be a balanced \(2\)-connected bipartite graph and \(S \subset V(G)\). We will say that \(S\) is cyclable in \(G\) if all vertices of \(S\) belong to a common cycle in \(G\).
Denise Amar +2 more
doaj +1 more source
Discrete Mathematics, 1986 Let \(A_{ij}\) be a binary triangle with base \(a_{1j}\), \(1\leq j\leq n\) such that \(a_{ij}=a_{i-1,j-1}+a_{i-1,j}\) for ...
openaire +3 more sources
Cocrystals and Solvates are Not the Same: A Network Perspective
ChemPhysChem, EarlyView.Based on network analysis, cocrystals and solvates cannot be treated the same. Cocrystals and solvates are two kinds of multicomponent crystals. Cocrystals consist of solid compounds, while solvates consist of a mixture of solid and liquid compounds. This work addresses the question of whether cocrystals and solvates can be treated the same or need to ...
Tom Edward de Vries +3 more
wiley +1 more source
On the irregularity of bipartite graphs
Discrete Mathematics, 2007 AbstractThe imbalance of an edge uv in a graph G is defined as |d(u)-d(v)|, where d(u) denotes the degree of u. The irregularity of G, denoted irr(G), is the sum of the edge imbalances taken over all edges in G. We determine the structure of bipartite graphs having maximum possible irregularity with given cardinalities of the partite sets and given ...
Dieter Rautenbach, Michael A. Henning
openaire +1 more source
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT Corporate social responsibility (CSR) is increasingly recognized as a strategic lever for enhancing organizational performance in construction, yet research on this nexus remains sparse. This study investigates how CSR practices generate organizational benefits through resource collaboration networks.
Qian Zhang, Yuanzhe Wu, Meng Ye
wiley +1 more source
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources