Results 91 to 100 of about 96,628 (243)
One-Three Join: A Graph Operation and Its Consequences
Discussiones Mathematicae Graph Theory, 2017 In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
doaj +1 more source
DBGE: Employee Turnover Prediction Based on Dynamic Bipartite Graph Embedding
IEEE Access, 2020 The issue of employee turnover is always critical for companies, and accurate predictions can help them prepare in time. Most past studies on employee turnover have focused on analyzing impact factors or using simple network centrality measures.
Xinjun Cai +6 more
doaj +1 more source
On the Q $Q$‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
Journal of Combinatorial Designs, EarlyView.ABSTRACT Let Γ ${\rm{\Gamma }}$ denote a finite, connected graph with vertex set X $X$. Fix x ∈ X $x\in X$ and let ε ≥ 3 $\varepsilon \ge 3$ denote the eccentricity of x $x$. For mutually distinct scalars { θ i * } i = 0 ε ${\{{\theta }_{i}^{* }\}}_{i=0}^{\varepsilon }$ define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) ${A}^
Blas Fernández +3 more
wiley +1 more source
An Approach to the Girth Problem in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all n $n$‐vertex cubic graphs is attained by a 2‐connected graph G = ( V , E ) $G=(V,E)$. By Petersen's graph theorem, E $E$ is the disjoint union of a 2‐factor and a perfect matching M $M$.
Aya Bernstine, Nati Linial
wiley +1 more source
On the nullity of bipartite graphs
Linear Algebra and its Applications, 2009 AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spectrum of the adjacency matrix of the graph. In this paper, we obtain the nullity set of bipartite graphs of order n, and characterize the bipartite graphs with nullity n-4 and the regular bipartite graphs with nullity n-6.
Yi-Zheng Fan, Ke-Shi Qian
openaire +2 more sources
People and Nature, EarlyView.Abstract Protected areas represent complex social‐ecological systems that require governance and management approaches that valorise and enhance positive relationships between people and nature. This study analyses the alignment between social and ecological systems to detect the social‐ecological fit of projects focused on biodiversity conservation ...
Elena Andriollo +4 more
wiley +1 more source
Multi-view Clustering Based on Bipartite Graph Cross-view Graph Diffusion [PDF]
Jisuanji kexueMulti-view clustering is an research hotspots in the field of unsupervised learning.Recently,the method based on cross-view graph diffusion uses the complementary information between multiple views to obtain a unified graph for clustering on the basis of
WANG Jinfu, WANG Siwei, LIANG Weixuan, YU Shengju, ZHU En
doaj +1 more source
physica status solidi (b), EarlyView.Density functional theory (DFT) and time‐dependent‐DFT studies reveal that the electronic properties of poly[(2,6‐(4,8‐bis(5‐(2‐hexyl)thiophen‐2‐yl)benzo[1,2‐b:4,5‐b’]dithiophene))‐alt‐(5,5‐(1’,3’‐di‐2‐thienyl‐5’,7’‐bis(2‐ethylhexyl)benzo[1’,2’‐c:4’,5’‐c’]dithiophene‐4,8‐dione)]‐T:3,9‐bis(2‐methylene‐(3‐(1,1‐dicyanomethylene)‐indanone))‐5,5,11,11 ...
Montassar Chaabani +2 more
wiley +1 more source
Entanglement in Quantum Systems Based on Directed Graphs
Advanced Quantum Technologies, EarlyView.The entanglement properties of quantum states associated with directed graphs are investigated. It is proved that the vertex degree distribution fully determines this entanglement measure, which remains invariant under vertex relabeling, thereby highlighting its topological character.
Lucio De Simone, Roberto Franzosi
wiley +1 more source
A Paradigm of Temporal‐Weather‐Aware Transition Pattern for POI Recommendation
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Point of interest (POI) recommendation analyses user preferences through historical check‐in data. However, existing POI recommendation methods often overlook the influence of weather information and face the challenge of sparse historical data for individual users.
Junyang Chen +6 more
wiley +1 more source