Academic literature on the topic 'Quasi-Bipartite graph'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quasi-Bipartite graph.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Quasi-Bipartite graph":
Ma, Junye, Qingguo Li, and Hui Li. "Some properties about the zero-divisor graphs of quasi-ordered sets." Journal of Algebra and Its Applications 19, no. 04 (June 12, 2019): 2050074. http://dx.doi.org/10.1142/s0219498820500747.
Ansari-Toroghy, Habibollah, Shokoufeh Habibi, and Masoomeh Hezarjaribi. "On the graph of modules over commutative rings II." Filomat 32, no. 10 (2018): 3657–65. http://dx.doi.org/10.2298/fil1810657a.
Kumar, P. Ramana Vijaya, and Dr Bhuvana Vijaya. "Applications of Hamiltonian Cycle from Quasi Spanning Tree of Faces based Bipartite Graph." Journal of Advanced Research in Dynamical and Control Systems 11, no. 12-SPECIAL ISSUE (December 31, 2019): 505–12. http://dx.doi.org/10.5373/jardcs/v11sp12/20193245.
Naji Hameed, Zainab, and Hiyam Hassan Kadhem. "On Degree Topology and Set-T_0 space." Wasit Journal of Computer and Mathematics Science 1, no. 4 (December 31, 2022): 213–19. http://dx.doi.org/10.31185/wjcm.91.
Rowlinson, Peter. "More on graphs with just three distinct eigenvalues." Applicable Analysis and Discrete Mathematics 11, no. 1 (2017): 74–80. http://dx.doi.org/10.2298/aadm161111033r.
Yu, Guidong, Gaixiang Cai, Miaolin Ye, and Jinde Cao. "Energy Conditions for Hamiltonicity of Graphs." Discrete Dynamics in Nature and Society 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/305164.
Lai, Xinsheng, Yuren Zhou, Xiaoyun Xia, and Qingfu Zhang. "Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems." Evolutionary Computation 25, no. 4 (December 2017): 707–23. http://dx.doi.org/10.1162/evco_a_00200.
Chen, Junpu, and Hong Xie. "An Online Learning Approach to Sequential User-Centric Selection Problems." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 6 (June 28, 2022): 6231–38. http://dx.doi.org/10.1609/aaai.v36i6.20572.
Zhao, Pan, Wenlei Guo, Datong Xu, Zhiliang Jiang, Jie Chai, Lijun Sun, He Li, and Weiliang Han. "Hypergraph-based resource allocation for Device-to-Device underlay H-CRAN network." International Journal of Distributed Sensor Networks 16, no. 8 (August 2020): 155014772095133. http://dx.doi.org/10.1177/1550147720951337.
Gröpl, Clemens, Stefan Hougardy, Till Nierhoff, and Hans Jürgen Prömel. "Steiner trees in uniformly quasi-bipartite graphs." Information Processing Letters 83, no. 4 (August 2002): 195–200. http://dx.doi.org/10.1016/s0020-0190(01)00335-0.
Dissertations / Theses on the topic "Quasi-Bipartite graph":
Pisanu, Francesco. "On box-total dual integrality and total equimodularity." Electronic Thesis or Diss., Paris 13, 2023. http://www.theses.fr/2023PA131044.
In this thesis, we study box-totally dual integral (box-TDI) polyhedra associated with severalproblems and totally equimodular matrices. Moreover, we study the complexity of some funda-mental questions related to them.We start by considering totally equimodular matrices, which are matrices such that, forevery subset of linearly independent rows, all nonsingular maximal submatrices have the samedeterminant in absolute value. Despite their similarities with totally unimodular matrices, wehighlight several differences, even in the case of incidence and adjacency matrices of graphs.As is well-known, the incidence matrix of a given graph is totally unimodular if and only if thegraph is bipartite. However, the total equimodularity of an incidence matrix depends on whetherwe consider the vertex-edge or the edge-vertex representation. We provide characterizations forboth cases. As a consequence, we prove that recognizing whether a given polyhedron is box-TDIis a co-NP-complete problem.Characterizing the total unimodularity or total equimodularity of the adjacency matrix of agiven bipartite graph remains unsolved, while we solved the corresponding problem in the case oftotal equimodularity when the graph is nonbipartite.In a later part of this work, we characterize the graphs for which the perfect matching polytope(PMP) is described by trivial inequalities and the inequalities corresponding to tight cuts. Tightcuts are defined as cuts that share precisely one edge with each perfect matching. We thenprove that any graph for which the corresponding PMP is box-TDI belongs to this class. Asa consequence, it turns out that recognizing whether the PMP is box-TDI is a polynomial-timeproblem. However, we provide several counterexamples showing that this class of graphs does notguarantee the box-TDIness of the PMP.Lastly, we present necessary conditions for the box-TDIness of the edge cover polytope andcharacterize the box-TDIness of the extendable matching polytope, which is the convex hull ofthe matchings included in a perfect matching
Book chapters on the topic "Quasi-Bipartite graph":
"Quasi-biclique Detection from Bipartite Graphs." In Network Data Mining and Analysis, 79–112. WORLD SCIENTIFIC, 2018. http://dx.doi.org/10.1142/9789813274969_0005.
Conference papers on the topic "Quasi-Bipartite graph":
Zhu, Na. "Signature of Quasi-Complete Graphs and Quasi-Complete Bipartite Graphs." In 2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, 2018. http://dx.doi.org/10.1109/fskd.2018.8686948.
Epishin, Vladlen I. "Studying Fault Tolerance of Bipartite Homogeneous Minimal Quasi-Complete Graphs Using Cisco Packet Tracer." In 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus). IEEE, 2021. http://dx.doi.org/10.1109/elconrus51938.2021.9396232.