CINXE.COM

<!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: bond graph</title> <meta name="description" content="Search results for: bond graph"> <meta name="keywords" content="bond graph"> <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="bond graph" 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="bond graph"> <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> 1025</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: bond graph</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1025</span> Defects Estimation of Embedded Systems Components by a Bond Graph Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20Gahlouz">I. Gahlouz</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Chellil"> A. Chellil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper concerns the estimation of system components faults by using an unknown inputs observer. To reach this goal, we used the Bond Graph approach to physical modelling. We showed that this graphical tool is allowing the representation of system components faults as unknown inputs within the state representation of the considered physical system. The study of the causal and structural features of the system (controllability, observability, finite structure, and infinite structure) based on the Bond Graph approach was hence fulfilled in order to design an unknown inputs observer which is used for the system component fault estimation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=estimation" title="estimation">estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=bond%20graph" title=" bond graph"> bond graph</a>, <a href="https://publications.waset.org/abstracts/search?q=controllability" title=" controllability"> controllability</a>, <a href="https://publications.waset.org/abstracts/search?q=observability" title=" observability"> observability</a> </p> <a href="https://publications.waset.org/abstracts/42724/defects-estimation-of-embedded-systems-components-by-a-bond-graph-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42724.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">413</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">1024</span> Robust Diagnosis of an Electro-Mechanical Actuators, Bond Graph LFT Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Boulanoir">A. Boulanoir</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Ould%20Bouamama"> B. Ould Bouamama</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Debiane"> A. Debiane</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Achour"> N. Achour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper deals with robust Fault Detection and isolation with respect to parameter uncertainties based on linear fractional transformation form (LFT) Bond graph. The innovative interest of the proposed methodology is the use only one representation for systematic generation of robust analytical redundancy relations and adaptive residual thresholds for sensibility analysis. Furthermore, the parameter uncertainties are introduced graphically in the bond graph model. The methodology applied to the nonlinear industrial Electro-Mechanical Actuators (EMA) used in avionic systems, has determined first the structural monitorability analysis (which component can be monitored) with given instrumentation architecture with any need of complex calculation and secondly robust fault indicators for online supervision. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond%20graph%20%28BG%29" title="bond graph (BG)">bond graph (BG)</a>, <a href="https://publications.waset.org/abstracts/search?q=electro%20mechanical%20actuators%20%28EMA%29" title=" electro mechanical actuators (EMA)"> electro mechanical actuators (EMA)</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection%20and%20isolation%20%28FDI%29" title=" fault detection and isolation (FDI)"> fault detection and isolation (FDI)</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20fractional%20transformation%20%28LFT%29" title=" linear fractional transformation (LFT)"> linear fractional transformation (LFT)</a>, <a href="https://publications.waset.org/abstracts/search?q=mechatronic%20systems" title=" mechatronic systems"> mechatronic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20uncertainties" title=" parameter uncertainties"> parameter uncertainties</a>, <a href="https://publications.waset.org/abstracts/search?q=avionic%20system" title=" avionic system"> avionic system</a> </p> <a href="https://publications.waset.org/abstracts/29219/robust-diagnosis-of-an-electro-mechanical-actuators-bond-graph-lft-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29219.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">1023</span> Modeling and Simulation of a Cycloconverter with a Bond Graph Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gerardo%20Ayala-Jaimes">Gerardo Ayala-Jaimes</a>, <a href="https://publications.waset.org/abstracts/search?q=Gilberto%20Gonzalez-Avalos"> Gilberto Gonzalez-Avalos</a>, <a href="https://publications.waset.org/abstracts/search?q=Allen%20A.%20Castillo"> Allen A. Castillo</a>, <a href="https://publications.waset.org/abstracts/search?q=Alejandra%20Jimenez"> Alejandra Jimenez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The modeling of a single-phase cycloconverter in Bond Graph is presented, which includes an alternating current power supply, hybrid dynamics, switch control, and resistive load; this approach facilitates the integration of systems across different energy domains and structural analysis. Cycloconverters, used in motor control, demonstrate the viability of graphical modeling. The use of Bonds is proposed to model the hybrid interaction of the system, and the results are displayed through simulations using 20Sim and Multisim software. The motivation behind developing these models with a graphical approach is to design and build low-cost energy converters, thereby making the main contribution of this document the modeling and simulation of a single-phase cycloconverter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond%20graph" title="bond graph">bond graph</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20system" title=" hybrid system"> hybrid system</a>, <a href="https://publications.waset.org/abstracts/search?q=rectifier" title=" rectifier"> rectifier</a>, <a href="https://publications.waset.org/abstracts/search?q=cycloconverter" title=" cycloconverter"> cycloconverter</a>, <a href="https://publications.waset.org/abstracts/search?q=modelling" title=" modelling"> modelling</a> </p> <a href="https://publications.waset.org/abstracts/187321/modeling-and-simulation-of-a-cycloconverter-with-a-bond-graph-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187321.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">1022</span> Modeling of Bioelectric Activity of Nerve Cells Using Bond Graph Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Ghasemi">M. Ghasemi</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Eskandari"> F. Eskandari</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Hamzehei"> B. Hamzehei</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20R.%20Arshi"> A. R. Arshi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bioelectric activity of nervous cells might be changed causing by various factors. This alteration can lead to unforeseen circumstances in other organs of the body. Therefore, the purpose of this study was to model a single neuron and its behavior under an initial stimulation. This study was developed based on cable theory by means of the Bond Graph method. The numerical values of the parameters were derived from empirical studies of cellular electrophysiology experiments. Initial excitation was applied through square current functions, and the resulted action potential was estimated along the neuron. The results revealed that the model was developed in this research adapted with the results of experimental studies and demonstrated the electrical behavior of nervous cells properly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond%20graph" title="bond graph">bond graph</a>, <a href="https://publications.waset.org/abstracts/search?q=stimulation" title=" stimulation"> stimulation</a>, <a href="https://publications.waset.org/abstracts/search?q=nervous%20cells" title=" nervous cells"> nervous cells</a>, <a href="https://publications.waset.org/abstracts/search?q=modeling" title=" modeling"> modeling</a> </p> <a href="https://publications.waset.org/abstracts/32701/modeling-of-bioelectric-activity-of-nerve-cells-using-bond-graph-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32701.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">429</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">1021</span> Robust Diagnosis Efficiency by Bond-Graph Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Benazzouz%20Djamel">Benazzouz Djamel</a>, <a href="https://publications.waset.org/abstracts/search?q=Termeche%20Adel"> Termeche Adel</a>, <a href="https://publications.waset.org/abstracts/search?q=Touati%20Youcef"> Touati Youcef</a>, <a href="https://publications.waset.org/abstracts/search?q=Alem%20Said"> Alem Said</a>, <a href="https://publications.waset.org/abstracts/search?q=Ouziala%20Mahdi"> Ouziala Mahdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an approach which detect and isolate efficiently a fault in a system. This approach avoids false alarms, non-detections and delays in detecting faults. A study case have been proposed to show the importance of taking into consideration the uncertainties in the decision-making procedure and their effect on the degradation diagnostic performance and advantage of using Bond Graph (BG) for such degradation. The use of BG in the Linear Fractional Transformation (LFT) form allows generating robust Analytical Redundancy Relations (ARR’s), where the uncertain part of ARR’s is used to generate the residuals adaptive thresholds. The study case concerns an electromechanical system composed of a motor, a reducer and an external load. The aim of this application is to show the effectiveness of the BG-LFT approach to robust fault detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond%20graph" title="bond graph">bond graph</a>, <a href="https://publications.waset.org/abstracts/search?q=LFT" title=" LFT"> LFT</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainties" title=" uncertainties"> uncertainties</a>, <a href="https://publications.waset.org/abstracts/search?q=detection%20and%20faults%20isolation" title=" detection and faults isolation"> detection and faults isolation</a>, <a href="https://publications.waset.org/abstracts/search?q=ARR" title=" ARR"> ARR</a> </p> <a href="https://publications.waset.org/abstracts/44029/robust-diagnosis-efficiency-by-bond-graph-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44029.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">305</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">1020</span> Robust Diagnosability of PEMFC Based on Bond Graph LFT</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ould%20Bouamama">Ould Bouamama</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Bressel"> M. Bressel</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Hissel"> D. Hissel</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Hilairet"> M. Hilairet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuel cell (FC) is one of the best alternatives of fossil energy. Recently, the research community of fuel cell has shown a considerable interest for diagnosis in view to ensure safety, security, and availability when faults occur in the process. The problematic for model based FC diagnosis consists in that the model is complex because of coupling of several kind of energies and the numerical values of parameters are not always known or are uncertain. The present paper deals with use of one tool: the Linear Fractional Transformation bond graph tool not only for uncertain modelling but also for monitorability (ability to detect and isolate faults) analysis and formal generation of robust fault indicators with respect to parameter uncertainties.The developed theory applied to a nonlinear FC system has proved its efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond%20graph" title="bond graph">bond graph</a>, <a href="https://publications.waset.org/abstracts/search?q=fuel%20cell" title=" fuel cell"> fuel cell</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection%20and%20isolation%20%28FDI%29" title=" fault detection and isolation (FDI)"> fault detection and isolation (FDI)</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20diagnosis" title=" robust diagnosis"> robust diagnosis</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20analysis" title=" structural analysis"> structural analysis</a> </p> <a href="https://publications.waset.org/abstracts/29565/robust-diagnosability-of-pemfc-based-on-bond-graph-lft" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29565.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">366</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">1019</span> Topological Indices of Some Graph Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=U.%20Mary">U. Mary </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let be a graph with a finite, nonempty set of objects called vertices together with a set of unordered pairs of distinct vertices of called edges. The vertex set is denoted by and the edge set by. Given two graphs and the wiener index of, wiener index for the splitting graph of a graph, the first Zagreb index of and its splitting graph, the 3-steiner wiener index of, the 3-steiner wiener index of a special graph are explored in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complementary%20prism%20graph" title="complementary prism graph">complementary prism graph</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20Zagreb%20index" title=" first Zagreb index"> first Zagreb index</a>, <a href="https://publications.waset.org/abstracts/search?q=neighborhood%20corona%20graph" title=" neighborhood corona graph"> neighborhood corona graph</a>, <a href="https://publications.waset.org/abstracts/search?q=steiner%20distance" title=" steiner distance"> steiner distance</a>, <a href="https://publications.waset.org/abstracts/search?q=splitting%20graph" title=" splitting graph"> splitting graph</a>, <a href="https://publications.waset.org/abstracts/search?q=steiner%20wiener%20index" title=" steiner wiener index"> steiner wiener index</a>, <a href="https://publications.waset.org/abstracts/search?q=wiener%20index" title=" wiener index"> wiener index</a> </p> <a href="https://publications.waset.org/abstracts/16774/topological-indices-of-some-graph-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16774.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">570</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">1018</span> Survey Paper on Graph Coloring Problem and Its Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prateek%20Chharia">Prateek Chharia</a>, <a href="https://publications.waset.org/abstracts/search?q=Biswa%20Bhusan%20Ghosh"> Biswa Bhusan Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph coloring is one of the prominent concepts in graph coloring. It can be defined as a coloring of the various regions of the graph such that all the constraints are fulfilled. In this paper various graphs coloring approaches like greedy coloring, Heuristic search for maximum independent set and graph coloring using edge table is described. Graph coloring can be used in various real time applications like student time tabling generation, Sudoku as a graph coloring problem, GSM phone network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20coloring" title="graph coloring">graph coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20coloring" title=" greedy coloring"> greedy coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20search" title=" heuristic search"> heuristic search</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20table" title=" edge table"> edge table</a>, <a href="https://publications.waset.org/abstracts/search?q=sudoku%20as%20a%20graph%20coloring%20problem" title=" sudoku as a graph coloring problem"> sudoku as a graph coloring problem</a> </p> <a href="https://publications.waset.org/abstracts/19691/survey-paper-on-graph-coloring-problem-and-its-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19691.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">539</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">1017</span> A New Graph Theoretic Problem with Ample Practical Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Hakan%20Karaata">Mehmet Hakan Karaata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we first coin a new graph theocratic problem with numerous applications. Second, we provide two algorithms for the problem. The first solution is using a brute-force techniques, whereas the second solution is based on an initial identification of the cycles in the given graph. We then provide a correctness proof of the algorithm. The applications of the problem include graph analysis, graph drawing and network structuring. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithm" title="algorithm">algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=cycle" title=" cycle"> cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20algorithm" title=" graph algorithm"> graph algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20structuring" title=" network structuring"> network structuring</a> </p> <a href="https://publications.waset.org/abstracts/67285/a-new-graph-theoretic-problem-with-ample-practical-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67285.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">386</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">1016</span> Modeling and Simulation of Underwater Flexible Manipulator as Raleigh Beam Using Bond Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sumit%20Kumar">Sumit Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Sunil%20Kumar"> Sunil Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandan%20Deep%20Singh"> Chandan Deep Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents modeling and simulation of flexible robot in an underwater environment. The underwater environment completely contrasts with ground or space environment. The robot in an underwater situation is subjected to various dynamic forces like buoyancy forces, hydrostatic and hydrodynamic forces. The underwater robot is modeled as Rayleigh beam. The developed model further allows estimating the deflection of tip in two directions. The complete dynamics of the underwater robot is analyzed, which is the main focus of this investigation. The control of robot trajectory is not discussed in this paper. Simulation is performed using Symbol Shakti software. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond%20graph%20modeling" title="bond graph modeling">bond graph modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamics.%20modeling" title=" dynamics. modeling"> dynamics. modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=rayleigh%20beam" title=" rayleigh beam"> rayleigh beam</a>, <a href="https://publications.waset.org/abstracts/search?q=underwater%20robot" title=" underwater robot"> underwater robot</a> </p> <a href="https://publications.waset.org/abstracts/33594/modeling-and-simulation-of-underwater-flexible-manipulator-as-raleigh-beam-using-bond-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33594.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">587</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">1015</span> Complete Tripartite Graphs with Spanning Maximal Planar Subgraphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Severino%20Gervacio">Severino Gervacio</a>, <a href="https://publications.waset.org/abstracts/search?q=Velimor%20Almonte"> Velimor Almonte</a>, <a href="https://publications.waset.org/abstracts/search?q=Emmanuel%20Natalio"> Emmanuel Natalio</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A simple graph is planar if it there is a way of drawing it in the plane without edge crossings. A planar graph which is not a proper spanning subgraph of another planar graph is a maximal planar graph. We prove that for complete tripartite graphs of order at most 9, the only ones that contain a spanning maximal planar subgraph are K1,1,1, K2,2,2, K2,3,3, and K3,3,3. The main result gives a necessary and sufficient condition for the complete tripartite graph Kx,y,z to contain a spanning maximal planar subgraph. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complete%20tripartite%20graph" title="complete tripartite graph">complete tripartite graph</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a>, <a href="https://publications.waset.org/abstracts/search?q=maximal%20planar%20graph" title=" maximal planar graph"> maximal planar graph</a>, <a href="https://publications.waset.org/abstracts/search?q=planar%20graph" title=" planar graph"> planar graph</a>, <a href="https://publications.waset.org/abstracts/search?q=subgraph" title=" subgraph"> subgraph</a> </p> <a href="https://publications.waset.org/abstracts/59157/complete-tripartite-graphs-with-spanning-maximal-planar-subgraphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59157.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">381</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">1014</span> A Modular and Reusable Bond Graph Model of Epithelial Transport in the Proximal Convoluted Tubule</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leyla%20Noroozbabaee">Leyla Noroozbabaee</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Nickerson"> David Nickerson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We introduce a modular, consistent, reusable bond graph model of the renal nephron’s proximal convoluted tubule (PCT), which can reproduce biological behaviour. In this work, we focus on ion and volume transport in the proximal convoluted tubule of the renal nephron. Modelling complex systems requires complex modelling problems to be broken down into manageable pieces. This can be enabled by developing models of subsystems that are subsequently coupled hierarchically. Because they are based on a graph structure. In the current work, we define two modular subsystems: the resistive module representing the membrane and the capacitive module representing solution compartments. Each module is analyzed based on thermodynamic processes, and all the subsystems are reintegrated into circuit theory in network thermodynamics. The epithelial transport system we introduce in the current study consists of five transport membranes and four solution compartments. Coupled dissipations in the system occur in the membrane subsystems and coupled free-energy increasing, or decreasing processes appear in solution compartment subsystems. These structural subsystems also consist of elementary thermodynamic processes: dissipations, free-energy change, and power conversions. We provide free and open access to the Python implementation to ensure our model is accessible, enabling the reader to explore the model through setting their simulations and reproducibility tests. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bond%20Graph" title="Bond Graph">Bond Graph</a>, <a href="https://publications.waset.org/abstracts/search?q=Epithelial%20Transport" title=" Epithelial Transport"> Epithelial Transport</a>, <a href="https://publications.waset.org/abstracts/search?q=Water%20Transport" title=" Water Transport"> Water Transport</a>, <a href="https://publications.waset.org/abstracts/search?q=Mathematical%20Modeling" title=" Mathematical Modeling"> Mathematical Modeling</a> </p> <a href="https://publications.waset.org/abstracts/162929/a-modular-and-reusable-bond-graph-model-of-epithelial-transport-in-the-proximal-convoluted-tubule" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162929.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">87</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">1013</span> Efficient Filtering of Graph Based Data Using Graph Partitioning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nileshkumar%20Vaishnav">Nileshkumar Vaishnav</a>, <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Tatu"> Aditya Tatu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An algebraic framework for processing graph signals axiomatically designates the graph adjacency matrix as the shift operator. In this setup, we often encounter a problem wherein we know the filtered output and the filter coefficients, and need to find out the input graph signal. Solution to this problem using direct approach requires O(N3) operations, where N is the number of vertices in graph. In this paper, we adapt the spectral graph partitioning method for partitioning of graphs and use it to reduce the computational cost of the filtering problem. We use the example of denoising of the temperature data to illustrate the efficacy of the approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signal%20processing" title="graph signal processing">graph signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20partitioning" title=" graph partitioning"> graph partitioning</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20filtering%20on%20graphs" title=" inverse filtering on graphs"> inverse filtering on graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20signal%20processing" title=" algebraic signal processing"> algebraic signal processing</a> </p> <a href="https://publications.waset.org/abstracts/59397/efficient-filtering-of-graph-based-data-using-graph-partitioning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59397.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">311</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">1012</span> Studying the Bond Strength of Geo-Polymer Concrete</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rama%20Seshu%20Doguparti">Rama Seshu Doguparti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the experimental investigation on the bond behavior of geo polymer concrete. The bond behavior of geo polymer concrete cubes of grade M35 reinforced with 16 mm TMT rod is analyzed. The results indicate that the bond performance of reinforced geo polymer concrete is good and thus proves its application for construction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geo-polymer" title="geo-polymer">geo-polymer</a>, <a href="https://publications.waset.org/abstracts/search?q=concrete" title=" concrete"> concrete</a>, <a href="https://publications.waset.org/abstracts/search?q=bond%20strength" title=" bond strength"> bond strength</a>, <a href="https://publications.waset.org/abstracts/search?q=behaviour" title=" behaviour"> behaviour</a> </p> <a href="https://publications.waset.org/abstracts/19114/studying-the-bond-strength-of-geo-polymer-concrete" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19114.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">508</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">1011</span> Improvement a Lower Bound of Energy for Some Family of Graphs, Related to Determinant of Adjacency Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saieed%20%20Akbari">Saieed Akbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Bagheri"> Yousef Bagheri</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Hossein%20Ghodrati"> Amir Hossein Ghodrati</a>, <a href="https://publications.waset.org/abstracts/search?q=Sima%20Saadat%20Akhtar"> Sima Saadat Akhtar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a simple graph with the vertex set V (G) and with the adjacency matrix A (G). The energy E (G) of G is defined to be the sum of the absolute values of all eigenvalues of A (G). Also let n and m be number of edges and vertices of the graph respectively. A regular graph is a graph where each vertex has the same number of neighbours. Given a graph G, its line graph L(G) is a graph such that each vertex of L(G) represents an edge of G; and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint in G. In this paper we show that for every regular graphs and also for every line graphs such that (G) 3 we have, E(G) 2nm + n 1. Also at the other part of the paper we prove that 2 (G) E(G) for an arbitrary graph G. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenvalues" title="eigenvalues">eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20graphs" title=" line graphs"> line graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=matching%20number" title=" matching number"> matching number</a> </p> <a href="https://publications.waset.org/abstracts/99652/improvement-a-lower-bound-of-energy-for-some-family-of-graphs-related-to-determinant-of-adjacency-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99652.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">232</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">1010</span> Graph Similarity: Algebraic Model and Its Application to Nonuniform Signal Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nileshkumar%20Vishnav">Nileshkumar Vishnav</a>, <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Tatu"> Aditya Tatu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A recent approach of representing graph signals and graph filters as polynomials is useful for graph signal processing. In this approach, the adjacency matrix plays pivotal role; instead of the more common approach involving graph-Laplacian. In this work, we follow the adjacency matrix based approach and corresponding algebraic signal model. We further expand the theory and introduce the concept of similarity of two graphs. The similarity of graphs is useful in that key properties (such as filter-response, algebra related to graph) get transferred from one graph to another. We demonstrate potential applications of the relation between two similar graphs, such as nonuniform filter design, DTMF detection and signal reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signal%20processing" title="graph signal processing">graph signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20signal%20processing" title=" algebraic signal processing"> algebraic signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20similarity" title=" graph similarity"> graph similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=isospectral%20graphs" title=" isospectral graphs"> isospectral graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=nonuniform%20signal%20processing" title=" nonuniform signal processing"> nonuniform signal processing</a> </p> <a href="https://publications.waset.org/abstracts/59404/graph-similarity-algebraic-model-and-its-application-to-nonuniform-signal-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59404.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">352</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">1009</span> Metric Dimension on Line Graph of Honeycomb Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Hussain">M. Hussain</a>, <a href="https://publications.waset.org/abstracts/search?q=Aqsa%20Farooq"> Aqsa Farooq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G = (V,E) be a connected graph and distance between any two vertices a and b in G is a−b geodesic and is denoted by d(a, b). A set of vertices W resolves a graph G if each vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G. In this paper line graph of honeycomb network has been derived and then we calculated the metric dimension on line graph of honeycomb network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Resolving%20set" title="Resolving set">Resolving set</a>, <a href="https://publications.waset.org/abstracts/search?q=Metric%20dimension" title=" Metric dimension"> Metric dimension</a>, <a href="https://publications.waset.org/abstracts/search?q=Honeycomb%20network" title=" Honeycomb network"> Honeycomb network</a>, <a href="https://publications.waset.org/abstracts/search?q=Line%20graph" title=" Line graph"> Line graph</a> </p> <a href="https://publications.waset.org/abstracts/101558/metric-dimension-on-line-graph-of-honeycomb-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101558.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">200</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">1008</span> Speedup Breadth-First Search by Graph Ordering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiuyi%20Lyu">Qiuyi Lyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Bin%20Gong"> Bin Gong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Breadth-First Search(BFS) is a core graph algorithm that is widely used for graph analysis. As it is frequently used in many graph applications, improve the BFS performance is essential. In this paper, we present a graph ordering method that could reorder the graph nodes to achieve better data locality, thus, improving the BFS performance. Our method is based on an observation that the sibling relationships will dominate the cache access pattern during the BFS traversal. Therefore, we propose a frequency-based model to construct the graph order. First, we optimize the graph order according to the nodes’ visit frequency. Nodes with high visit frequency will be processed in priority. Second, we try to maximize the child nodes overlap layer by layer. As it is proved to be NP-hard, we propose a heuristic method that could greatly reduce the preprocessing overheads. We conduct extensive experiments on 16 real-world datasets. The result shows that our method could achieve comparable performance with the state-of-the-art methods while the graph ordering overheads are only about 1/15. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=breadth-first%20search" title="breadth-first search">breadth-first search</a>, <a href="https://publications.waset.org/abstracts/search?q=BFS" title=" BFS"> BFS</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20ordering" title=" graph ordering"> graph ordering</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20algorithm" title=" graph algorithm"> graph algorithm</a> </p> <a href="https://publications.waset.org/abstracts/136790/speedup-breadth-first-search-by-graph-ordering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136790.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">138</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">1007</span> Mostar Type Indices and QSPR Analysis of Octane Isomers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Roopa%20Sri">B. Roopa Sri</a>, <a href="https://publications.waset.org/abstracts/search?q=Y%20Lakshmi%20Naidu"> Y Lakshmi Naidu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Chemical Graph Theory (CGT) is the branch of mathematical chemistry in which molecules are modeled to study their physicochemical properties using molecular descriptors. Amongst these descriptors, topological indices play a vital role in predicting the properties by defining the graph topology of the molecule. Recently, the bond-additive topological index known as the Mostar index has been proposed. In this paper, we compute the Mostar-type indices of octane isomers and use the data obtained to perform QSPR analysis. Furthermore, we show the correlation between the Mostar type indices and the properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20graph%20theory" title="chemical graph theory">chemical graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=mostar%20type%20indices" title=" mostar type indices"> mostar type indices</a>, <a href="https://publications.waset.org/abstracts/search?q=octane%20isomers" title=" octane isomers"> octane isomers</a>, <a href="https://publications.waset.org/abstracts/search?q=qspr%20analysis" title=" qspr analysis"> qspr analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20index" title=" topological index"> topological index</a> </p> <a href="https://publications.waset.org/abstracts/153959/mostar-type-indices-and-qspr-analysis-of-octane-isomers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153959.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">130</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">1006</span> A Study of Families of Bistar and Corona Product of Graph: Reverse Topological Indices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gowtham%20Kalkere%20Jayanna">Gowtham Kalkere Jayanna</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamad%20Nazri%20Husin"> Mohamad Nazri Husin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph theory, chemistry, and technology are all combined in cheminformatics. The structure and physiochemical properties of organic substances are linked using some useful graph invariants and the corresponding molecular graph. In this paper, we study specific reverse topological indices such as the reverse sum-connectivity index, the reverse Zagreb index, the reverse arithmetic-geometric, and the geometric-arithmetic, the reverse Sombor, the reverse Nirmala indices for the bistar graphs B (n: m) and the corona product Kₘ∘Kₙ', where Kₙ' Represent the complement of a complete graph Kₙ. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reverse%20topological%20indices" title="reverse topological indices">reverse topological indices</a>, <a href="https://publications.waset.org/abstracts/search?q=bistar%20graph" title=" bistar graph"> bistar graph</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20corona%20product" title=" the corona product"> the corona product</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a> </p> <a href="https://publications.waset.org/abstracts/166540/a-study-of-families-of-bistar-and-corona-product-of-graph-reverse-topological-indices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166540.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">97</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">1005</span> Experimental Investigation on the Effect of Bond Thickness on the Interface Behaviour of Fibre Reinforced Polymer Sheet Bonded to Timber</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Vahedian">Abbas Vahedian</a>, <a href="https://publications.waset.org/abstracts/search?q=Rijun%20Shrestha"> Rijun Shrestha</a>, <a href="https://publications.waset.org/abstracts/search?q=Keith%20Crews"> Keith Crews</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The bond mechanism between timber and fibre reinforced polymer (FRP) is relatively complex and is influenced by a number of variables including bond thickness, bond width, bond length, material properties, and geometries. This study investigates the influence of bond thickness on the behaviour of interface, failure mode, and bond strength of externally bonded FRP-to-timber interface. In the present study, 106 single shear joint specimens have been investigated. Experiment results showed that higher layers of FRP increase the ultimate load carrying capacity of interface; conversely, such increase led to decrease the slip of interface. Moreover, samples with more layers of FRPs may fail in a brittle manner without noticeable warning that collapse is imminent. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fibre%20reinforced%20polymer" title="fibre reinforced polymer">fibre reinforced polymer</a>, <a href="https://publications.waset.org/abstracts/search?q=FRP" title=" FRP"> FRP</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20shear%20test" title=" single shear test"> single shear test</a>, <a href="https://publications.waset.org/abstracts/search?q=bond%20thickness" title=" bond thickness"> bond thickness</a>, <a href="https://publications.waset.org/abstracts/search?q=bond%20strength" title=" bond strength"> bond strength</a> </p> <a href="https://publications.waset.org/abstracts/100515/experimental-investigation-on-the-effect-of-bond-thickness-on-the-interface-behaviour-of-fibre-reinforced-polymer-sheet-bonded-to-timber" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100515.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">229</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">1004</span> On the Zeros of the Degree Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20R.%20Nayaka">S. R. Nayaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Putta%20Swamy"> Putta Swamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20polynomial" title="degree polynomial">degree polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=regular%20graph" title=" regular graph"> regular graph</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20and%20maximum%20degree" title=" minimum and maximum degree"> minimum and maximum degree</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operations" title=" graph operations"> graph operations</a> </p> <a href="https://publications.waset.org/abstracts/56602/on-the-zeros-of-the-degree-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56602.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">249</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">1003</span> From Convexity in Graphs to Polynomial Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ladznar%20S.%20Laja">Ladznar S. Laja</a>, <a href="https://publications.waset.org/abstracts/search?q=Rosalio%20G.%20Artes"> Rosalio G. Artes</a>, <a href="https://publications.waset.org/abstracts/search?q=Jr."> Jr.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20subgraph" title="convex subgraph">convex subgraph</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20index" title=" convex index"> convex index</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20function" title=" generating function"> generating function</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a> </p> <a href="https://publications.waset.org/abstracts/9019/from-convexity-in-graphs-to-polynomial-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9019.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">215</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">1002</span> Model-Independent Price Bounds for the Swiss Re Mortality Bond 2003</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raj%20Kumari%20Bahl">Raj Kumari Bahl</a>, <a href="https://publications.waset.org/abstracts/search?q=Sotirios%20Sabanis"> Sotirios Sabanis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we are concerned with the valuation of the first Catastrophic Mortality Bond that was launched in the market namely the Swiss Re Mortality Bond 2003. This bond encapsulates the behavior of a well-defined mortality index to generate payoffs for the bondholders. Pricing this bond is a challenging task. We adapt the payoff of the terminal principal of the bond in terms of the payoff of an Asian put option and present an approach to derive model-independent bounds exploiting comonotonic theory. We invoke Jensen’s inequality for the computation of lower bounds and employ Lagrange optimization technique to achieve the upper bound. The success of these bounds is based on the availability of compatible European mortality options in the market. We carry out Monte Carlo simulations to estimate the bond price and illustrate the strength of these bounds across a variety of models. The fact that our bounds are model-independent is a crucial breakthrough in the pricing of catastrophic mortality bonds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mortality%20bond" title="mortality bond">mortality bond</a>, <a href="https://publications.waset.org/abstracts/search?q=Swiss%20Re%20Bond" title=" Swiss Re Bond"> Swiss Re Bond</a>, <a href="https://publications.waset.org/abstracts/search?q=mortality%20index" title=" mortality index"> mortality index</a>, <a href="https://publications.waset.org/abstracts/search?q=comonotonicity" title=" comonotonicity"> comonotonicity</a> </p> <a href="https://publications.waset.org/abstracts/54923/model-independent-price-bounds-for-the-swiss-re-mortality-bond-2003" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54923.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">250</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">1001</span> An Application of Graph Theory to The Electrical Circuit Using Matrix Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samai%27la%20Abdullahi">Samai'la Abdullahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A graph is a pair of two set and so that a graph is a pictorial representation of a system using two basic element nodes and edges. A node is represented by a circle (either hallo shade) and edge is represented by a line segment connecting two nodes together. In this paper, we present a circuit network in the concept of graph theory application and also circuit models of graph are represented in logical connection method were we formulate matrix method of adjacency and incidence of matrix and application of truth table. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euler%20circuit%20and%20path" title="euler circuit and path">euler circuit and path</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20representation%20of%20circuit%20networks" title=" graph representation of circuit networks"> graph representation of circuit networks</a>, <a href="https://publications.waset.org/abstracts/search?q=representation%20of%20graph%20models" title=" representation of graph models"> representation of graph models</a>, <a href="https://publications.waset.org/abstracts/search?q=representation%20of%20circuit%20network%20using%20logical%20truth%20table" title=" representation of circuit network using logical truth table"> representation of circuit network using logical truth table</a> </p> <a href="https://publications.waset.org/abstracts/32358/an-application-of-graph-theory-to-the-electrical-circuit-using-matrix-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32358.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">561</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">1000</span> Building 1-Well-Covered Graphs by Corona, Join, and Rooted Product of Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vadim%20E.%20Levit">Vadim E. Levit</a>, <a href="https://publications.waset.org/abstracts/search?q=Eugen%20Mandrescu"> Eugen Mandrescu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A graph is well-covered if all its maximal independent sets are of the same size. A well-covered graph is 1-well-covered if deletion of every vertex of the graph leaves it well-covered. It is known that a graph without isolated vertices is 1-well-covered if and only if every two disjoint independent sets are included in two disjoint maximum independent sets. Well-covered graphs are related to combinatorial commutative algebra (e.g., every Cohen-Macaulay graph is well-covered, while each Gorenstein graph without isolated vertices is 1-well-covered). Our intent is to construct several infinite families of 1-well-covered graphs using the following known graph operations: corona, join, and rooted product of graphs. Adopting some known techniques used to advantage for well-covered graphs, one can prove that: if the graph G has no isolated vertices, then the corona of G and H is 1-well-covered if and only if H is a complete graph of order two at least; the join of the graphs G and H is 1-well-covered if and only if G and H have the same independence number and both are 1-well-covered; if H satisfies the property that every three pairwise disjoint independent sets are included in three pairwise disjoint maximum independent sets, then the rooted product of G and H is 1-well-covered, for every graph G. These findings show not only how to generate some more families of 1-well-covered graphs, but also that, to this aim, sometimes, one may use graphs that are not necessarily 1-well-covered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=maximum%20independent%20set" title="maximum independent set">maximum independent set</a>, <a href="https://publications.waset.org/abstracts/search?q=corona" title=" corona"> corona</a>, <a href="https://publications.waset.org/abstracts/search?q=concatenation" title=" concatenation"> concatenation</a>, <a href="https://publications.waset.org/abstracts/search?q=join" title=" join"> join</a>, <a href="https://publications.waset.org/abstracts/search?q=well-covered%20graph" title=" well-covered graph"> well-covered graph</a> </p> <a href="https://publications.waset.org/abstracts/86859/building-1-well-covered-graphs-by-corona-join-and-rooted-product-of-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86859.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">208</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">999</span> Hydrogen Production Using an Anion-Exchange Membrane Water Electrolyzer: Mathematical and Bond Graph Modeling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hugo%20Daneluzzo">Hugo Daneluzzo</a>, <a href="https://publications.waset.org/abstracts/search?q=Christelle%20Rabbat"> Christelle Rabbat</a>, <a href="https://publications.waset.org/abstracts/search?q=Alan%20Jean-Marie"> Alan Jean-Marie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Water electrolysis is one of the most advanced technologies for producing hydrogen and can be easily combined with electricity from different sources. Under the influence of electric current, water molecules can be split into oxygen and hydrogen. The production of hydrogen by water electrolysis favors the integration of renewable energy sources into the energy mix by compensating for their intermittence through the storage of the energy produced when production exceeds demand and its release during off-peak production periods. Among the various electrolysis technologies, anion exchange membrane (AEM) electrolyser cells are emerging as a reliable technology for water electrolysis. Modeling and simulation are effective tools to save time, money, and effort during the optimization of operating conditions and the investigation of the design. The modeling and simulation become even more important when dealing with multiphysics dynamic systems. One of those systems is the AEM electrolysis cell involving complex physico-chemical reactions. Once developed, models may be utilized to comprehend the mechanisms to control and detect flaws in the systems. Several modeling methods have been initiated by scientists. These methods can be separated into two main approaches, namely equation-based modeling and graph-based modeling. The former approach is less user-friendly and difficult to update as it is based on ordinary or partial differential equations to represent the systems. However, the latter approach is more user-friendly and allows a clear representation of physical phenomena. In this case, the system is depicted by connecting subsystems, so-called blocks, through ports based on their physical interactions, hence being suitable for multiphysics systems. Among the graphical modelling methods, the bond graph is receiving increasing attention as being domain-independent and relying on the energy exchange between the components of the system. At present, few studies have investigated the modelling of AEM systems. A mathematical model and a bond graph model were used in previous studies to model the electrolysis cell performance. In this study, experimental data from literature were simulated using OpenModelica using bond graphs and mathematical approaches. The polarization curves at different operating conditions obtained by both approaches were compared with experimental ones. It was stated that both models predicted satisfactorily the polarization curves with error margins lower than 2% for equation-based models and lower than 5% for the bond graph model. The activation polarization of hydrogen evolution reactions (HER) and oxygen evolution reactions (OER) were behind the voltage loss in the AEM electrolyzer, whereas ion conduction through the membrane resulted in the ohmic loss. Therefore, highly active electro-catalysts are required for both HER and OER while high-conductivity AEMs are needed for effectively lowering the ohmic losses. The bond graph simulation of the polarisation curve for operating conditions at various temperatures has illustrated that voltage increases with temperature owing to the technology of the membrane. Simulation of the polarisation curve can be tested virtually, hence resulting in reduced cost and time involved due to experimental testing and improved design optimization. Further improvements can be made by implementing the bond graph model in a real power-to-gas-to-power scenario. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hydrogen%20production" title="hydrogen production">hydrogen production</a>, <a href="https://publications.waset.org/abstracts/search?q=anion-exchange%20membrane" title=" anion-exchange membrane"> anion-exchange membrane</a>, <a href="https://publications.waset.org/abstracts/search?q=electrolyzer" title=" electrolyzer"> electrolyzer</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20modeling" title=" mathematical modeling"> mathematical modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=multiphysics%20modeling" title=" multiphysics modeling"> multiphysics modeling</a> </p> <a href="https://publications.waset.org/abstracts/165397/hydrogen-production-using-an-anion-exchange-membrane-water-electrolyzer-mathematical-and-bond-graph-modeling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165397.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">91</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">998</span> Nullity of t-Tupple Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khidir%20R.%20Sharaf">Khidir R. Sharaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Didar%20A.%20Ali"> Didar A. Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The nullity η (G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation of the weights f (w) over all neighborhood w of v is zero for each v in G.A high zero-sum weighting of G is one that uses maximum number of non-zero independent variables. If G is graph with an end vertex, and if H is an induced sub-graph of G obtained by deleting this vertex together with the vertex adjacent to it, then, η(G)= η(H). In this paper, a high zero-sum weighting technique and the end vertex procedure are applied to evaluate the nullity of t-tupple and generalized t-tupple graphs are derived and determined for some special types of graphs. Also, we introduce and prove some important results about the t-tupple coalescence, Cartesian and Kronecker products of nut graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title="graph theory">graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20spectra" title=" graph spectra"> graph spectra</a>, <a href="https://publications.waset.org/abstracts/search?q=nullity%20of%20graphs" title=" nullity of graphs"> nullity of graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=statistic" title=" statistic"> statistic</a> </p> <a href="https://publications.waset.org/abstracts/4759/nullity-of-t-tupple-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4759.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">239</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">997</span> An Experimental Investigation of Bond Properties of Reinforcements Embedded in Geopolymer Concrete</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jee-Sang%20Kim">Jee-Sang Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jong%20Ho%20Park"> Jong Ho Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Geopolymer concretes are a new class of construction materials that have emerged as an alternative to Ordinary Portland cement concrete. Considerable researches have been carried out on material development of geopolymer concrete, however, a few studies have been reported on the structural use of them. This paper presents the bond behaviors of reinforcement embedded in fly ash based geopolymer concrete. The development lengths of reinforcement for various compressive strengths of concrete, 20, 30 and 40 MPa, and reinforcement diameters, 10, 16, and 25 mm are investigated. Total 27 specimens were manufactured and pull-out test according to EN 10080 was applied to measure bond strength and slips between concrete and reinforcements. The average bond strengths decreased from 23.06MPa to 17.26 MPa, as the diameters of reinforcements increased from 10mm to 25mm. The compressive strength levels of geopolymer concrete showed no significant influence on bond strengths in this study. Also, the bond-slip relations between geopolymer concrete and reinforcement are derived using non-linear regression analysis for various experimental conditions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bond-slip%20relation" title="bond-slip relation">bond-slip relation</a>, <a href="https://publications.waset.org/abstracts/search?q=bond%20strength" title=" bond strength"> bond strength</a>, <a href="https://publications.waset.org/abstracts/search?q=geopolymer%20concrete" title=" geopolymer concrete"> geopolymer concrete</a>, <a href="https://publications.waset.org/abstracts/search?q=pull-out%20test" title=" pull-out test"> pull-out test</a> </p> <a href="https://publications.waset.org/abstracts/14860/an-experimental-investigation-of-bond-properties-of-reinforcements-embedded-in-geopolymer-concrete" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14860.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">349</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">996</span> Structural Properties, Natural Bond Orbital, Theory Functional Calculations (DFT), and Energies for Fluorous Compounds: C13H12F7ClN2O</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahriar%20Ghammamy">Shahriar Ghammamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Masomeh%20Shahsavary"> Masomeh Shahsavary </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the optimized geometries and frequencies of the stationary point and the minimum energy paths of C13H12F7ClN2O are calculated by using the DFT (B3LYP) methods with LANL2DZ basis sets. B3LYP/ LANL2DZ calculation results indicated that some selected bond length and bond angles values for the C13H12F7ClN2O. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=C13H12F7ClN2O" title="C13H12F7ClN2O">C13H12F7ClN2O</a>, <a href="https://publications.waset.org/abstracts/search?q=vatural%20bond%20orbital" title=" vatural bond orbital"> vatural bond orbital</a>, <a href="https://publications.waset.org/abstracts/search?q=fluorous%20compounds" title=" fluorous compounds"> fluorous compounds</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20calculations" title=" functional calculations"> functional calculations</a> </p> <a href="https://publications.waset.org/abstracts/6062/structural-properties-natural-bond-orbital-theory-functional-calculations-dft-and-energies-for-fluorous-compounds-c13h12f7cln2o" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6062.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">336</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=34">34</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=35">35</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bond%20graph&page=2" rel="next">&rsaquo;</a></li> </ul> </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>