Results 81 to 90 of about 1,011,259 (278)
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Discrete Mathematics, 2002 The authors consider the problem of finding subgraphs of the complete bipartite graph \(K_{m,n}\) which do not contain a subgraph isomorphic to a copy of \(K_{s,t}\) and are maximal with respect to this property. They translate this problem to the terminology of partial block designs.
Bryant, DE, Fu, HL
openaire +2 more sources
Subsquares in Random Latin Squares and Rectangles
Journal of Combinatorial Designs, EarlyView.ABSTRACT A k×n $k\times n$ partial Latin rectangle is C‐sparse $C \mbox{-} \mathrm{sparse}$ if the number of nonempty entries in each row and column is at most C $C$ and each symbol is used at most C $C$ times. We prove that the probability a uniformly random k×n $k\times n$ Latin rectangle, where k<(1∕2−α)n $k\lt (1\unicode{x02215}2-\alpha )n ...
Alexander Divoux +3 more
wiley +1 more source
Limnology and Oceanography: Methods, EarlyView.Abstract Acoustic cameras, or imaging sonars, are often used to monitor marine energy sites in regions where the water is too dark or turbid for optical sensing. To do so more effectively, scientists are investigating automated detection methodologies to use on these data.
Theodore Nowak +2 more
wiley +1 more source
Quasistationary Distribution for the Invasion Model on a Complete Bipartite Graph [PDF]
, 2022 Iddo Ben-Ari +5 more
openalex +1 more source
Networks, EarlyView.ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk +2 more
wiley +1 more source
Journal of Robotics, 2020 The paper discusses the solution of the assignment task between two groups of mobile (MR) objects. The assignment task is to determine the purpose of MR to each other when playing football.
Denis Aleksandrovich Beloglazov +3 more
doaj +1 more source
H - V -Super-Strong- ( a , d ) -antimagic decomposition of complete bipartite graphs [PDF]
, 2023 S. Stalin Kumar
openalex +1 more source
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
Networks, EarlyView.ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann +4 more
wiley +1 more source