Results 51 to 60 of about 1,017,247 (314)
Counting independent sets in unbalanced bipartite graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the sides $(L,R)$ of the bipartition. This includes, among others, the biregular
Sarah Cannon, Will Perkins
semanticscholar +1 more source
Independent Complementary Distance Pattern Uniform Graphs [PDF]
, 2009 A graph G =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2, ·· ·,Mk ⊂ V (G) such that fMi (u) ={d(u, v):v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k.
Koshy, Beena +3 more
core +1 more source
Journal of Graph Algorithms and Applications, 2021 Let $G=(V,E)$ be a graph and let $S\subseteq V$ be a subset of its vertices. If the subgraph of $G$ induced by $V\setminus S$ is acyclic, then $S$ is said to be a decycling set of $G$. The size of a smallest decycling set of $G$ is called the decycling number of $G$. Determining the decycling number of a graph $G$ is NP-hard, even if $G$ is bipartite.
openaire +3 more sources
Spin-Orbit-Induced Topological Flat Bands in Line and Split Graphs of Bipartite Lattices. [PDF]
Physical Review Letters, 2020 Topological flat bands, such as the band in twisted bilayer graphene, are becoming a promising platform to study topics such as correlation physics, superconductivity, and transport.
Da-Shuai Ma +6 more
semanticscholar +1 more source
Large-girth roots of graphs [PDF]
, 2010 We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal +4 more
core +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
Mathematics, 2021 In recent decades, distributed consensus-based algorithms for data aggregation have been gaining in importance in wireless sensor networks since their implementation as a complementary mechanism can ensure sensor-measured values with high reliability and
Martin Kenyeres, Jozef Kenyeres
doaj +1 more source
BiRank: Towards Ranking on Bipartite Graphs [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2017 The bipartite graph is a ubiquitous data structure that can model the relationship between two entity types: for instance, users and items, queries and webpages.
Xiangnan He +3 more
semanticscholar +1 more source
Random Generation and Enumeration of Bipartite Permutation Graphs [PDF]
, 2011 Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given.
Yota Otachi +7 more
core +1 more source