IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v433y2022ics009630032200488x.html
   My bibliography  Save this article

The maximum outdegree power of complete k-partite oriented graphs

Author

Listed:
  • Xu, Chentao
  • You, Zhe
  • Zhang, Liwen
  • Zhou, Minghong

Abstract

Suppose that Gσ is an oriented graph with order n and orientation σ. For d1+≥d2+≥⋯≥dn+, the outdegree sequence of Gσ is denoted by (d1+,d2+,…,dn+). Similar to the definition of the degree power for a simple graph, define the outdegree power for an oriented graph Gσ by ∂q+(Gσ)=∑i=1n(di+)q where q is a positive integer. Obviously, ∂1+(Gσ)=|E(G)|. Denote by G(G) the set of oriented graphs whose underlying graph is isomorphic to G, where G is a simple graph. In the paper, we concentrate on the problem: How large the value of ∂q+(Gσ) could be among all oriented graphs in G(G)? Using majorization, we prove that Kn1,…,nk→ is the unique extremal graph which attains the maximum outdegree power ∂q+(Gσ) over all oriented graphs in G(Kn1,…,nk) for q>ln(n−n1+1)ln(1+1n−n1−1). Further, we present several results about the extrema of ∂q+(Gσ) over all complete k-partite oriented graphs.

Suggested Citation

  • Xu, Chentao & You, Zhe & Zhang, Liwen & Zhou, Minghong, 2022. "The maximum outdegree power of complete k-partite oriented graphs," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    • Handle: RePEc:eee:apmaco:v:433:y:2022:i:c:s009630032200488x
    DOI: 10.1016/j.amc.2022.127414
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032200488X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127414?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.

    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:eee:apmaco:v:433:y:2022:i:c:s009630032200488x. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.