IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i3d10.1007_s10878-021-00704-6.html
   My bibliography  Save this article

Some mixed graphs with H-rank 4, 6 or 8

Author

Listed:
  • Jinling Yang

    (Northwestern Polytechnical University
    Northwestern Polytechnical University
    Northwestern Polytechnical University)

  • Ligong Wang

    (Northwestern Polytechnical University
    Northwestern Polytechnical University)

  • Xiuwen Yang

    (Northwestern Polytechnical University
    Northwestern Polytechnical University)

Abstract

The H-rank of a mixed graph $$G^{\alpha }$$ G α is defined to be the rank of its Hermitian adjacency matrix $$H(G^{\alpha })$$ H ( G α ) . If $$ G^{\alpha } $$ G α is switching equivalent to a mixed graph $$(G^{\alpha })' $$ ( G α ) ′ , and two vertices u, v of $$G^{\alpha }$$ G α have exactly the same neighborhood in $$(G^{\alpha })'$$ ( G α ) ′ , then u and v are said to be twins. The twin reduction graph $$T_{G^{\alpha }}$$ T G α of $$G^{\alpha }$$ G α is a mixed graph whose vertices are the equivalence classes, and $$[u][v]\in E(T_{G^{\alpha }})$$ [ u ] [ v ] ∈ E ( T G α ) if $$uv\in E((G^{\alpha })')$$ u v ∈ E ( ( G α ) ′ ) , where [u] denotes the equivalence class containing the vertex u. In this paper, we give the upper (resp., lower) bound of the number of vertices of the twin reduction graphs of connected mixed bipartite graphs, and characterize all twin reduction graphs of the connected mixed bipartite graphs with H-rank 4 (resp., 6 or 8). Then, we characterize all connected mixed graphs with H-rank 4 (resp., 6 or 8) among all mixed graphs containing induced mixed odd cycles whose lengths are no less than 5 (resp., 7 or 9).

Suggested Citation

  • Jinling Yang & Ligong Wang & Xiuwen Yang, 2021. "Some mixed graphs with H-rank 4, 6 or 8," Journal of Combinatorial Optimization, Springer, vol. 41(3), pages 678-693, April.
  • Handle: RePEc:spr:jcomop:v:41:y:2021:i:3:d:10.1007_s10878-021-00704-6
    DOI: 10.1007/s10878-021-00704-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00704-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-021-00704-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Feng, Zhimin & Huang, Jing & Li, Shuchao & Luo, Xiaobing, 2019. "Relationship between the rank and the matching number of a graph," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 411-421.
    2. Xueliang Li & Wen Xia, 2019. "Skew-rank of an oriented graph and independence number of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 268-277, July.
    3. Jing Huang & Shuchao Li & Hua Wang, 2018. "Relation between the skew-rank of an oriented graph and the independence number of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 65-80, July.
    4. Qu, Hui & Yu, Guihai, 2015. "Bicyclic oriented graphs with skew-rank 2 or 4," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 182-191.
    5. Lu, Yong & Wang, Ligong & Zhou, Qiannan, 2015. "Bicyclic oriented graphs with skew-rank 6," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 899-908.
    6. Yong Lu & Ligong Wang & Qiannan Zhou, 2019. "The rank of a complex unit gain graph in terms of the rank of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 570-588, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yong Lu & Ligong Wang & Qiannan Zhou, 2019. "The rank of a complex unit gain graph in terms of the rank of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 570-588, August.
    2. Jing Huang & Shuchao Li & Hua Wang, 2018. "Relation between the skew-rank of an oriented graph and the independence number of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 65-80, July.
    3. Feng, Zhimin & Huang, Jing & Li, Shuchao & Luo, Xiaobing, 2019. "Relationship between the rank and the matching number of a graph," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 411-421.
    4. Xueliang Li & Wen Xia, 2019. "Skew-rank of an oriented graph and independence number of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 268-277, July.
    5. Lang, Rongling & Li, Tao & Mo, Desen & Shi, Yongtang, 2016. "A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 115-121.
    6. Lu, Yong & Wang, Ligong & Zhou, Qiannan, 2015. "Bicyclic oriented graphs with skew-rank 6," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 899-908.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:41:y:2021:i:3:d:10.1007_s10878-021-00704-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.