Search results for: digraph

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: digraph</title> <meta name="description" content="Search results for: digraph"> <meta name="keywords" content="digraph"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="digraph" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="digraph"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 7</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: digraph</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7</span> On the Girth of the Regular Digraph of Ideals of a ‎Commutative ‎Ring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Masoud%20Karimi">Masoud Karimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> ‎Let R be a commutative ring‎. ‎The regular digraph of ideals of R, which is denoted by‎ Γ(R)‎, ‎is a digraph whose vertex-set is the set of all ‎non-‎trivial ideals of R and‎, ‎for every‎ two distinct vertices I and J‎, ‎there is an arc from I to J‎, ‎whenever I contains‎ a non-zero-divisor on J. In this article, ‎we ‎show ‎that an indecomposable ‎Noetherian ring ‎‎‎R ‎is ‎Artinian ‎local ‎if ‎and ‎only ‎if Z(I)=Z(R) ‎for ‎every ‎non-nilpotent ‎ideal ‎‎‎I‎. ‎Then ‎we ‎conclude ‎that ‎‎the ‎girth ‎of‎ Γ(R)‎ ‎is ‎not ‎equal ‎to ‎four. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=commutative%20ring%E2%80%8E" title="commutative ring‎">commutative ring‎</a>, <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8Egirth%E2%80%8E" title=" ‎girth‎"> ‎girth‎</a>, <a href="https://publications.waset.org/abstracts/search?q=regular%20digraph%E2%80%8E" title=" regular digraph‎"> regular digraph‎</a>, <a href="https://publications.waset.org/abstracts/search?q=zero-divisor" title=" zero-divisor"> zero-divisor</a> </p> <a href="https://publications.waset.org/abstracts/14244/on-the-girth-of-the-regular-digraph-of-ideals-of-a-commutative-ring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14244.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">279</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">6</span> Generalized Rough Sets Applied to Graphs Related to Urban Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mihai%20Rebenciuc">Mihai Rebenciuc</a>, <a href="https://publications.waset.org/abstracts/search?q=Simona%20Mihaela%20Bibic"> Simona Mihaela Bibic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Branch of modern mathematics, graphs represent instruments for optimization and solving practical applications in various fields such as economic networks, engineering, network optimization, the geometry of social action, generally, complex systems including contemporary urban problems (path or transport efficiencies, biourbanism, & c.). In this paper is studied the interconnection of some urban network, which can lead to a simulation problem of a digraph through another digraph. The simulation is made univoc or more general multivoc. The concepts of fragment and atom are very useful in the study of connectivity in the digraph that is simulation - including an alternative evaluation of k- connectivity. Rough set approach in (bi)digraph which is proposed in premier in this paper contribute to improved significantly the evaluation of k-connectivity. This rough set approach is based on generalized rough sets - basic facts are presented in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=%28bi%29digraphs" title="(bi)digraphs">(bi)digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=rough%20set%20theory" title=" rough set theory"> rough set theory</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20of%20interacting%20agents" title=" systems of interacting agents"> systems of interacting agents</a>, <a href="https://publications.waset.org/abstracts/search?q=complex%20systems" title=" complex systems"> complex systems</a> </p> <a href="https://publications.waset.org/abstracts/77919/generalized-rough-sets-applied-to-graphs-related-to-urban-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77919.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">243</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5</span> Undirected Endo-Cayley Digraphs of Cyclic Groups of Order Primes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chanon%20Promsakon">Chanon Promsakon</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=endo-Cayley%20graph" title="endo-Cayley graph">endo-Cayley graph</a>, <a href="https://publications.waset.org/abstracts/search?q=undirected%20digraphs" title=" undirected digraphs"> undirected digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20groups" title=" cyclic groups"> cyclic groups</a>, <a href="https://publications.waset.org/abstracts/search?q=endomorphism" title=" endomorphism"> endomorphism</a> </p> <a href="https://publications.waset.org/abstracts/5030/undirected-endo-cayley-digraphs-of-cyclic-groups-of-order-primes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5030.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">350</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4</span> Digraph Generated by Idempotents in Certain Finite Semigroup of Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Ibrahim">Hassan Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Moses%20Anayo%20Mbah"> Moses Anayo Mbah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The idempotent generators in a finite full transformation and the digraph of full transformation semi group have been an interesting area of research in group theory. In this work, it characterized some idempotent elements in full transformation semigroup T_n by counting the strongly connected and disconnected digraphs, and also the weakly and unilaterally connected digraphs. The order for those digraphs was further obtained in T_n. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digraphs" title="digraphs">digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=indempotent" title=" indempotent"> indempotent</a>, <a href="https://publications.waset.org/abstracts/search?q=semigroup" title=" semigroup"> semigroup</a>, <a href="https://publications.waset.org/abstracts/search?q=transformation" title=" transformation"> transformation</a> </p> <a href="https://publications.waset.org/abstracts/187023/digraph-generated-by-idempotents-in-certain-finite-semigroup-of-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187023.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">38</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3</span> Sustainability Modelling and Sustainability Evaluation of a Mechanical System in a Concurrent Engineering Environment: A Digraph and Matrix Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anand%20Ankush">Anand Ankush</a>, <a href="https://publications.waset.org/abstracts/search?q=Wani%20Mohammed%20Farooq"> Wani Mohammed Farooq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A procedure based on digraph and matrix method is developed for modelling and evaluation of sustainability of Mechanical System in a concurrent engineering environment.The sustainability parameters of a Mechanical System are identified and are called sustainability attributes. Consideration of attributes and their interrelations is rudiment in modeling and evaluation of sustainability index. Sustainability attributes of a Mechanical System are modelled in termsof sustainability digraph. The graph is represented by a one-to-one matrix for sustainability expression which is based on sustainability attributes. A variable sustainability relationship permanent matrix is defined to develop sustainability expression(VPF-t) which is also useful in comparing two systems in a concurrent environment. The sustainability index of Mechanical System is obtained from permanent of matrix by substituting the numerical values of attributes and their interrelations. A higher value of index implies better sustainability of system.The ideal value of index is obtained from matrix expression which is useful in assessing relative sustainability of a Mechanical System in a concurrent engineering environment. The procedure is not only useful for evaluation of sustainability of a Mechanical System at conceptual design stage but can also be used for design and development of systems at system design stage. A step-by-step procedure for evaluation of sustainability index is also suggested and is illustrated by means of an example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digraph" title="digraph">digraph</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20method" title=" matrix method"> matrix method</a>, <a href="https://publications.waset.org/abstracts/search?q=mechanical%20system" title=" mechanical system"> mechanical system</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a> </p> <a href="https://publications.waset.org/abstracts/25964/sustainability-modelling-and-sustainability-evaluation-of-a-mechanical-system-in-a-concurrent-engineering-environment-a-digraph-and-matrix-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25964.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">364</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2</span> Independence and Path Independence on Cayley Digraphs of Left Groups and Right Groups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nuttawoot%20Nupo">Nuttawoot Nupo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cayley%20digraphs" title="Cayley digraphs">Cayley digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=independence%20number" title=" independence number"> independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=left%20groups" title=" left groups"> left groups</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20independence%20number" title=" path independence number"> path independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20groups" title=" right groups"> right groups</a> </p> <a href="https://publications.waset.org/abstracts/59306/independence-and-path-independence-on-cayley-digraphs-of-left-groups-and-right-groups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59306.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">231</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1</span> Development of Graph-Theoretic Model for Ranking Top of Rail Lubricants </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Subhash%20Chandra%20Sharma">Subhash Chandra Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Soleimani"> Mohammad Soleimani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Selection of the correct lubricant for the top of rail application is a complex process. In this paper, the selection of the proper lubricant for a Top-Of-Rail (TOR) lubrication system based on graph theory and matrix approach has been developed. Attributes influencing the selection process and their influence on each other has been represented through a digraph and an equivalent matrix. A matrix function which is called the Permanent Function is derived. By substituting the level of inherent contribution of the influencing parameters and their influence on each other qualitatively, a criterion called Suitability Index is derived. Based on these indices, lubricants can be ranked for their suitability. The proposed model can be useful for maintenance engineers in selecting the best lubricant for a TOR application. The proposed methodology is illustrated step–by-step through an example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lubricant%20selection" title="lubricant selection">lubricant selection</a>, <a href="https://publications.waset.org/abstracts/search?q=top%20of%20rail%20lubrication" title=" top of rail lubrication"> top of rail lubrication</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-theory" title=" graph-theory"> graph-theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranking%20of%20lubricants" title=" Ranking of lubricants"> Ranking of lubricants</a> </p> <a href="https://publications.waset.org/abstracts/51856/development-of-graph-theoretic-model-for-ranking-top-of-rail-lubricants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51856.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">295</span> </span> </div> </div> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>

CINXE.COM

Search results for: digraph